Chinese remaindering for algebraic numbers in a hidden field

Iqor E Shparlinski, Ron Steinfeld

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    1 Citation (Scopus)

    Abstract

    We use lattice reduction to obtain a polynomial time algorithm for Chinese Remaindering in algebraic number fields in the case when the field itself is unknown.
    Original languageEnglish
    Title of host publicationAlgorithmic Number Theory
    Subtitle of host publication5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings
    EditorsClaus Fieker, David R. Kohel
    Place of PublicationBerlin Germany
    PublisherSpringer
    Pages349-356
    Number of pages8
    ISBN (Print)3540438637
    DOIs
    Publication statusPublished - 2002
    EventInternational Symposium on Algorithmic Number Theory 2002 - Sydney, Australia
    Duration: 7 Jul 200212 Jul 2002
    Conference number: 5th
    https://link.springer.com/book/10.1007/3-540-45455-1 (Proceedings)

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume2369
    ISSN (Print)0302-9743

    Conference

    ConferenceInternational Symposium on Algorithmic Number Theory 2002
    Abbreviated titleANTS-V 2002
    CountryAustralia
    CitySydney
    Period7/07/0212/07/02
    Internet address

    Cite this