Abstract
In [7] and [3] the difficulty of the Discrete-Logarithm problem in the cycle of reduced principal ideals in a real-quadratic number field was used as basis for the construction of secure cryptographic protcols. In [14] a Diffie-Hellman key exchange variant based on a real-quadratic congruence function fields is presented. We generalize and extend these results by investigating real-quadratic A-fields. We define the Distance problem, the Discrete-Logarithm problem and the Diffie-Hellman problem in the cycle of reduced principal ideals in real-quadratic A-fields and discuss their difficulty. We show that with respect to probabilistic polynomial time reductions the Distance problem and the Discrete-Logarithm problem are equivalent and are at least as difficult as the Diffie-Hellman problem. Moreover we introduce the problem of computing square roots of reduced principal ideals in real-quadratic A-fields as another computationally difficult problem. In real-quadratic number fields this again is at least as difficult as the integer factorization problem. In congruence function fields the problem of computing square roots is supposed to be even more difficult than in number fields. We present a secure bit commitment scheme based on the difficulty of the square root problem and an oblivious transfer protocol based on the Diffie-Hellman problem. These protocols are important since they may serve as components for the construction of more sophisticated cryptographic protocols.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Mihir Bellare, Silvio Micali, Non-Interactive Oblivious Transfer and Applications, Proceedings of CRYPTO'89, 1989.
D.J. Bernstein, A.K. Lenstra, A general number field sieve implementation, In: A.K. Lenstra, H.W. Lenstra Jr.(Eds.) The Development of the Number Field Sieve (LNM 1554), Springer Verlag, 1993, pp. 103–126.
Ingrid Biehl, Johannes Buchmann, Algorithms for Quadratic Orders, Proceedings of Symposia in Applied Mathematics, vol. 48, American Mathematical Society, 1994, pp. 425–451.
Ingrid Biehl, Johannes Buchmann, Christoph Thiel, Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders, Proceedings of CRYPTO'94, Springer, 1995.
Johannes Buchmann, Jürgen Loho, Jörg Zayer, An Implementation of the General Number Field Sieve, Proceedings of CRYPTO'93 (LNCS 773), Springer Verlag, pp. 159–165, 1993.
Johannes Buchmann, Christoph Thiel, Hugh C. Williams, Short Representation of Quadratic Integers, Proceedings of CANT, Springer, 1992.
Johannes Buchmann, Hugh C. Williams, A Key Exchange System Based on Real-quadratic Fields, Proceedings of CRYPTO'89, Springer, 1989, pp. 335–343.
J.P. Buhler, H.W. Lenstra, C. Pomerance, Factoring integers with the number field sieve, LNCS 1554, pp. 50–94, 1993, Springer-Verlag.
Claude Crepeau, Jeroen van de Graaf, Alain Tapp, Committed Obivious Transfer and Private Multi-Party Computation, Proceedings of CRYPTO'95, pp. 110–123, 1995.
W. Diffie, M. Hellman, New Directions in Cryptography, IEEE Trans. Inform. Theory 22, pp. 472–492, 1976.
S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, 18:186–208, 1989.
D. Gordon, Discrete Logarithms in GF(p) Using the Number Field Sieve, SIAM Journal on Discrete Mathematics, 1993, pp. 124–138.
Renate Scheidler, Compact Representation in Real Quadratic Congruence Function Fields, to appear in the Proceedings of ANTS II.
Renate Scheidler, Andreas Stein, Hugh C. Williams, Key Exchange in Real Quadratic Congruence Function Fields, Designs, Codes and Cryptography, vol.7, no.1/2, pp. 153–174, 1996.
Oliver Schirokauer, Damian Weber, Thomas Denny, Discrete Logarithms and the Effectiveness of the Index Calculus Method, to appear in the Proceedings of ANTS II, 1996.
Bruce Schneier, Applied Cryptography, Second Edition, John Wiley and Sons, Inc., 1996.
D. Shanks, The Infrastructure of a Real Quadratic Field and its Applications, Proceedings of the 1972 Number Theory Conference, Boulder, pp. 217–224, 1972.
R.J. Schoof, Quadratic fields and factorization, In: H.W. Lenstra, R. Tijdemans (Eds.), Computational methods in number theory, Part II, Math. Centrum Tracts 155, pp. 235–286, 1982.
Andreas Stein, Equivalences Between Elliptic Curves and Real Quadratic Congruence Function Fields, to appear in the Proceedings of PRAGOCRYPT'96.
Douglas R. Stinson, Cryptography, Theory and Practice, CRC Press, 1995.
Christoph Thiel, On the Complexity of Some Problems in Algorithmic Algebraic Number Theory, PhD Thesis, Universität des Saarlandes, 1995.
Andre Weil, Basic Number Theory, Springer, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag
About this paper
Cite this paper
Biehl, I., Meyer, B., Thiel, C. (1996). Cryptographic protocols based on real-quadratic A-fields (extended abstract). In: Kim, K., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '96. ASIACRYPT 1996. Lecture Notes in Computer Science, vol 1163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034831
Download citation
DOI: https://doi.org/10.1007/BFb0034831
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61872-0
Online ISBN: 978-3-540-70707-3
eBook Packages: Springer Book Archive