https://scigraph.springernature.com/explorer/license/
http://link.springer.com/10.1023/A:1008341625464
en
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98
2000-06
In 1 Matsumoto and Imai developed a new public key scheme, called C*, for enciphering or signing. (This scheme is completely different from and should not be mistaken with another scheme of Matsumoto and Imai developed in 1983 in 7 and broken in 1984 in 8). No attacks have been published as yet for this scheme. However, in this paper, we will see thatâ€”for almost all keysâ€”almost every cleartext can be found from its ciphertext after only approximately m2n4 log n computations, where m is the degree of the chosen field K and mn is the number of bits of text. Moreover, for absolutely all keys that give a practical size for the messages, it will be possible to find almost all cleartexts from the corresponding ciphertexts after a feasible computation. Thus the algorithm of 1 is insecure.
2019-04-10T19:06
175-209
2000-06-01
research_article
articles
false
Information and Computing Sciences
1573-7586
0925-1022
Designs, Codes and Cryptography
Patarin
Jacques
2
d4faa397b175fa6483e80c53d35a8c6a03ca6a900614cf9fd60be670eb22d16d
readcube_id
Computation Theory and Mathematics
Springer Nature - SN SciGraph project
20
Bull SC&T - 68, route de Versailles -, 78431, Louveciennes Cedex -, France
doi
10.1023/a:1008341625464
dimensions_id
pub.1044711662