Abstract
We investigate the possibility of cryptographic primitives over nonclassical computational models. We replace the traditional finite field F n * with the infinite field ℚ of rational numbers, and we give all parties unbounded computational power. We also give parties the ability to sample random real numbers. We determine that secure signature schemes and secure encryption schemes do not exist. We then prove more generally that it is impossible for two parties to agree upon a shared secret in this model. This rules out many other cryptographic primitives, such as Diffie-Hellman key exchange, oblivious transfer and interactive encryption.
Chapter PDF
References
Artin, M., “Algebra,” Prentice-Hall, 1991.
Burmester, M., Rivest, R., Shamir, A., Geometric Cryptography, http://theory.lcs.mit.edu/~rivest/publications.html, 1997.
Kaplansky, I., “Fields and Rings,” Second Edition, University of Chicago Press, 1972.
Morandi, P., “Field and Galois Theory, Graduate Texts in Mathematics,” Volume 167, Springer-Verlag, 1996.
Rompel, J., One-way Functions are Necessary and Sufficient for Secure Signatures, ACM Symp. on Theory of Computing 22 (1990), 387–394.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woodruff, D.P., van Dijk, M. (2002). Cryptography in an Unbounded Computational Model. In: Knudsen, L.R. (eds) Advances in Cryptology — EUROCRYPT 2002. EUROCRYPT 2002. Lecture Notes in Computer Science, vol 2332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46035-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-46035-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43553-2
Online ISBN: 978-3-540-46035-0
eBook Packages: Springer Book Archive