Abstract
The meet-in-the-middle attack can be used for forging signatures on mixed-type digital signature schemes, and takes less time than an exhaustive attack. This paper formulates a meet-in-the-middle attack on mixed-type digital signature schemes, shows the necessary conditions for success, and discusses the relationships between computational and space complexities as well as success probability during the attack. We also analyze an optimal strategy for forgers to apply this attack, pointing out that an intermediate value of 64 bit length is not secure for any mixed-type digital signature scheme. Finally, we show how to design secure mixed-type digital signature schemes.
Key words
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Diffie, W., and Hellman, M.: “New direction in cryptography”, IEEE Trans. Inf. Theory. IT-22, 6, pp.644–654 (Nov. 1976)
Akl, S. G.: “Digital signatures: A tutorial survey”, IEEE Computer, 16, 2, pp.15–24 (Feb. 1983)
Denning, D. E.: “Protecting public keys and signature keys”, IEEE Computer, 16, 2, pp.27–35 (Feb. 1983)
Davies, D. W.: “Applying the RSA digital signature to electronic mail”, IEEE Computer, 16, 2, pp.55–62 (Feb. 1983)
Koyama, K.: “Fast and Secure Digital Signature Using Public-Key Cryptosystems”, Trans. of IECE of Japan, J67-D, 3, pp.305–312 (Mar. 1984)
Ohta, K., and Koyama, K.: “A meet-in-the-middle attack against digital signature methods”, Trans. of IECE of Japan, J70-D, 2, pp.415–422 (Feb. 1987)
Davies, D. W., and Price, W. L.: “The application of digital signatures based on public key cryptosystems”, Proc of ICC, pp.525–530 (Oct. 1980)
Diffie, W., and Hellman, M.: “Exhaustive cryptanalysis of the NBS data encryption standard”, IEEE Computer. 10, 6, pp.74–84 (June. 1977)
National Bureau of Standards: “Data Encryption Standard”, FIPS PUB 46, NBS (Jan. 1977)
Rabin, M. O.: “Digitalized signatures and public-key functions as intractable as factorization”, Tech. Rep. MIT/LCS/TR MIT Lab. Comput. Sci. (1979)
International Organization for Standardization: “Modes of operation for a 64bit block cipher algorithm, ISO8372 (1987)
Rivest, R. L., Shamir, A., and Adlemen, L.: “A method of obtaining digital signature and public-key cryptosystems”, Commun. ACM, 21, 2, pp.120–126 (Feb. 1978)
Winternitz, R. S.: “Producing a one-way hash function from DES”, Advances in Cryptology Proceedings of Crypto 83, Plenum Press, pp.203–207, New York (1984)
Akl, S. G.: “On the security of compressed encoding”, Advances in Cryptology Proceedings of Crypto 83, Plenum Press, pp.209–230, New York (1984)
Coppersmith, D.: “Another birthday attack (Draft)”, Proceedings of Crypto 85, Lecture Note in Computer Science, 218, Springer-Verlag, pp.14–17 (1986)
Merkle, R. C.: “On the Security of Multiple Encryption”, Commun. ACM, 24, 7, pp.465–467 (1981)
Even, S., and Goldreich, O.: “On the power of cascade cipher”, Advances in Cryptology Proceedings of Crypto 83, Plenum Press, pp.43–50, New York (1984)
Rabin, M. O,: “Digital signatures”, Foundation of Secure Computation, Academic Press (1978)
Mueller-Schloer, C.: “DES-generated checksum for electronic signatures”, Cryptologia, pp.257–273 (July 1983)
Yuval, G.: “How to swindle Rabin”, Cryptologia, 3, 3, pp.187–190 (July 1979)
Girault, M., Cohen, R., and Campana, M.: “A Generalized Birthday Attack”, Proceedings of Eurocrypt 88, Lecture Note in Computer Science, 330, Springer-Verlag, pp.129–156 (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohta, K., Koyama, K. (1990). Meet-in-the-middle attack on digital signature schemes. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030357
Download citation
DOI: https://doi.org/10.1007/BFb0030357
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53000-8
Online ISBN: 978-3-540-46297-2
eBook Packages: Springer Book Archive