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 language | English |
---|---|
Title of host publication | Algorithmic Number Theory |
Subtitle of host publication | 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings |
Editors | Claus Fieker, David R. Kohel |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 349-356 |
Number of pages | 8 |
ISBN (Print) | 3540438637 |
DOIs | |
Publication status | Published - 2002 |
Event | International Symposium on Algorithmic Number Theory 2002 - Sydney, Australia Duration: 7 Jul 2002 → 12 Jul 2002 Conference number: 5th https://link.springer.com/book/10.1007/3-540-45455-1 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 2369 |
ISSN (Print) | 0302-9743 |
Conference
Conference | International Symposium on Algorithmic Number Theory 2002 |
---|---|
Abbreviated title | ANTS-V 2002 |
Country/Territory | Australia |
City | Sydney |
Period | 7/07/02 → 12/07/02 |
Internet address |
|