Chinese remaindering for algebraic numbers in a hidden field

Igor Shparlinski; Ron Steinfeld

doi:10.1007/3-540-45455-1_28

Chinese remaindering for algebraic numbers in a hidden field

Igor Shparlinski, Ron Steinfeld

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-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 language	English
Title of host publication	Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings
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
Publisher	Springer, Springer Nature
Pages	349-356
Number of pages	8
ISBN (Print)	3540438637
DOIs	https://doi.org/10.1007/3-540-45455-1_28
Publication status	Published - 2002
Event	5th International Algorithmic Number Theory Symposium, ANTS 2002 - Sydney, Australia Duration: 7 Jul 2002 → 12 Jul 2002

Publication series

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

Other

Other	5th International Algorithmic Number Theory Symposium, ANTS 2002
Country/Territory	Australia
City	Sydney
Period	7/07/02 → 12/07/02

Access to Document

10.1007/3-540-45455-1_28

Cite this

Shparlinski, I., & Steinfeld, R. (2002). Chinese remaindering for algebraic numbers in a hidden field. In C. Fieker, & D. R. Kohel (Eds.), Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 proceedings (pp. 349-356). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2369). Springer, Springer Nature. https://doi.org/10.1007/3-540-45455-1_28

Shparlinski, Igor ; Steinfeld, Ron. / Chinese remaindering for algebraic numbers in a hidden field. Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 proceedings. editor / Claus Fieker ; David R. Kohel. Berlin : Springer, Springer Nature, 2002. pp. 349-356 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0623f44dd14c4ddba132b7475b4b7e68,

title = "Chinese remaindering for algebraic numbers in a hidden field",

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.",

author = "Igor Shparlinski and Ron Steinfeld",

year = "2002",

doi = "10.1007/3-540-45455-1_28",

language = "English",

isbn = "3540438637",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "349--356",

editor = "Claus Fieker and Kohel, {David R.}",

booktitle = "Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings",

address = "United States",

note = "5th International Algorithmic Number Theory Symposium, ANTS 2002 ; Conference date: 07-07-2002 Through 12-07-2002",

}

Shparlinski, I & Steinfeld, R 2002, Chinese remaindering for algebraic numbers in a hidden field. in C Fieker & DR Kohel (eds), Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2369, Springer, Springer Nature, Berlin, pp. 349-356, 5th International Algorithmic Number Theory Symposium, ANTS 2002, Sydney, Australia, 7/07/02. https://doi.org/10.1007/3-540-45455-1_28

Chinese remaindering for algebraic numbers in a hidden field. / Shparlinski, Igor; Steinfeld, Ron.
Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 proceedings. ed. / Claus Fieker; David R. Kohel. Berlin: Springer, Springer Nature, 2002. p. 349-356 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2369).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Chinese remaindering for algebraic numbers in a hidden field

AU - Shparlinski, Igor

AU - Steinfeld, Ron

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958536226&partnerID=8YFLogxK

U2 - 10.1007/3-540-45455-1_28

DO - 10.1007/3-540-45455-1_28

M3 - Conference proceeding contribution

AN - SCOPUS:84958536226

SN - 3540438637

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 349

EP - 356

BT - Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings

A2 - Fieker, Claus

A2 - Kohel, David R.

PB - Springer, Springer Nature

CY - Berlin

T2 - 5th International Algorithmic Number Theory Symposium, ANTS 2002

Y2 - 7 July 2002 through 12 July 2002

ER -

Shparlinski I, Steinfeld R. Chinese remaindering for algebraic numbers in a hidden field. In Fieker C, Kohel DR, editors, Algorithmic Number Theory - 5th International Symposium, ANTS-V Sydney, Australia, July 7-12, 2002 Proceedings: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 proceedings. Berlin: Springer, Springer Nature. 2002. p. 349-356. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45455-1_28

Chinese remaindering for algebraic numbers in a hidden field

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this