Abstract
We present a new one way function based on the difficulty of finding shortest vectors in lattices. This new function consists of exponentiation of an ideal in an order of a number field and multiplication by an algebraic number which can both be performed in polynomial time. The best known algorithm for inverting this function is exponential in the degree of the lattices involved.
Chapter PDF
References
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.
J. Buchmann and S. Düllmann. 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.
E. Bach and J. Shallit. Algorithmic number theory. MIT Press, Cambridge, Massachusetts and London, England, 1996.
J. Buchmann. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields. Séminaire de théorie des nombres, pages 28–41, 1988.
J. Buchmann and H.C. Williams. A key-exchange system based on imaginary quadratic fields. Journal of Cryptology, 1:107–118, 1988.
J. Buchmann and H.C. Williams. Quadratic fields and cryptography. Number Theory and Cryptography, London Math. Soc. Lecture Note Series, 154:9–26, 1990.
H. Cohen. A course in computational algebraic number theory. Springer, Heidelberg, 2nd edition edition, 1995.
The LiDIA Group. LiDIA — A library for computational number theory. Technische Hochschule Darmstadt, Germany. http://www.informatik.th-darmstadt.de/TI/LiDIA.
R. Kannan. Minkowski's konvex body theorem and integer programming. Mathematics of operations research, 12, no. 5, 1987.
N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48:203–209, 1987.
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.
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.
C.P. Schnorr. A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science, 53:201–224, 1987.
C. Thiel. On some computational problems in algebraic number theory. PhD thesis, UniversitÄt des Saarlandes, Saarbrücken, Germany, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Buchmann, J., Paulus, S. (1997). A one way function based on ideal arithmetic in number fields. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052250
Download citation
DOI: https://doi.org/10.1007/BFb0052250
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive