Chinese remaindering for algebraic numbers in a hidden field

Igor Shparlinski, Ron Steinfeld

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

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 - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings
Subtitle of host publication5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 proceedings
EditorsClaus Fieker, David R. Kohel
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Pages349-356
Number of pages8
ISBN (Print)3540438637
DOIs
Publication statusPublished - 2002
Event5th International Algorithmic Number Theory Symposium, ANTS 2002 - Sydney, Australia
Duration: 7 Jul 200212 Jul 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2369
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Algorithmic Number Theory Symposium, ANTS 2002
CountryAustralia
CitySydney
Period7/07/0212/07/02

Fingerprint Dive into the research topics of 'Chinese remaindering for algebraic numbers in a hidden field'. Together they form a unique fingerprint.

Cite this