Abstract
At Eurocrypt’89 W. J. Jaburek suggested an algorithm, which he called pseudo exponentiation, for use in generalized El-Gamal type public key cryptosystems. This pseudo exponentiation uses a modified form of binary addition in the place of multiplication in an ordinary exponentiation.
In this paper we show that the pseudo exponentiation on the set GF(2)k of bitstrings of length k has a considerable amount of mathematical structure. Using this structure we present an algorithm for inverting pseudo exponentiation that has a running time polynomial in k.
Chapter PDF
Similar content being viewed by others
References
T. Beth, Efficient Zero-Knowledge Identification Scheme for Smart Cards, Adv. in Cryptology-EUROCRYPT’ 88, Springer, Berlin 1988, pp. 77–84.
W. Diffie, M. Hellman, New Directions in Cryptography, IEEE Trans. on Information Theory 22, 1976, pp. 644–654.
T. El-Gamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. on Information Theory 31, 1985, pp. 469–472.
W. J. Jaburek, A generalization of El-Gamal’s public key cryptposystem, Adv. in Cryptology — EUROCRYPT’ 89, to appear.
N. Koblitz, Elliptic Curve Cryptosystems, Math. of Computation 48, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bauspieß, F., Knobloch, HJ., Wichmann, P. (1991). Inverting the Pseudo Exponentiation. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive