A one way function based on ideal arithmetic in number fields

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

Volumn 1294, Issue , 1997, Pages 385-394

  Buchmann, Johannes ^a   Paulus, Sachar ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Number fields; One way function; Shortest vectors in lattices

Indexed keywords

DATA COMMUNICATION SYSTEMS; POLYNOMIAL APPROXIMATION;

ALGEBRAIC NUMBERS; BEST-KNOWN ALGORITHMS; EXPONENTIATIONS; NEW FUNCTIONS; NUMBER FIELDS; ONE-WAY FUNCTIONS; POLYNOMIAL-TIME;

CRYPTOGRAPHY;

EID: 84958667547     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052250     Document Type: Conference Paper

References (14)

1. I. Biehl, J. Buchmann, Bernd Meyer, Christian Thiel, and Christoph Thiel. Tools for proving zero knowledge. In Proc. of EUROCRYPT'92, Lecture Notes in Computer Science, pages 356-365. Springer, 1992.
2. J. Buchmann and S. Dullmann. On the computation of discrete logarithms in class groups. In Proc. of CRYPTO'90, volume 537 of Lecture Notes in Computer Science, pages 134-139. Springer, 1990.
3. E. Bach and J. Shallit. Algorithmic number theory. MIT Press, Cambridge, Massachusetts and London, England, 1996.
4. J. Buchmann. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. Siminaire de thiorie des nombres, pages 28-41, 1988.
5. J. Buchmann and H.C. Williams. A key-exchange system based on imaginary quadratic fields. Journal of Cryptology, 1:107-118, 1988.
6. J. Buchmann and H.C. Williams. Quadratic fields and cryptography. Number Theory and Cryptography, London Math. Soc. Lecture Note Series, 154:9-26, 1990.
7. H. Cohen. A course in computational algebraic number theory. Springer, Heidelberg, 2nd edition edition, 1995.
8. The LiDIA Group. LiDIA - A library for computational number theory. Technische Hochschule Darmstadt, Germany. http://www.informatik.th-darmstadt.de/TI/LiDIA.
9. R. Kannan. Minkowski's konvex body theorem and integer programming. Mathematics of operations research, 12, no. 5, 1987.
10. N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48:203-209, 1987.
11. A.M. Odlyzko. Discrete logarithms in finite fields and their cryptographic significance. In Proc. of EUROCRYPT'84, volume 209 of Lecture Notes in Computer Science, pages 224-314. Springer, 1985.
12. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21:120-126, 1978.
13. C.R Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science, 53:201-224, 1987.
14. C. Thiel. On some computational problems in algebraic number theory. PhD thesis, Universitat des Saarlandes, Saarbriicken, Germany, 1995.