Cryptanalysis of the m: Permutation Protection Schemes
Conference Proceeding Article
Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP'98, Fung and Gray proposed an m - permutation protection scheme against the EEPROM modification attack. At ACISP99, Fung and Gray pointed out that in their original scheme, a secret key with too small or too large Hamming weight could be recovered easily. Then they proposed a revised m - permutation protection scheme and claimed that their revised scheme does not leak any information of the secret key. In this paper, we break completely both the original and the revised m - permutation protection schemes. The original scheme is broken with about 2log2 n devices from the same batch and about (3log2 n + 2)×m× n probes ( n is the length of the secret key and m is the amount of permutations). The revised m - permutation protection scheme is more vulnerable than the original one. It could be broken with only one device and about m×n3/3 probes.
Public key cryptography, Data privacy, Information protection, Secrecy protection, Security key, Computer security
Information Security and Privacy: 5th Australasian Conference, ACISP 2000, Brisbane, Australia, July 10-12, 2000. Proceedings
City or Country
WU, Hongjun; BAO, Feng; YE, Dingfeng; and DENG, Robert H..
Cryptanalysis of the m: Permutation Protection Schemes. (2000). Information Security and Privacy: 5th Australasian Conference, ACISP 2000, Brisbane, Australia, July 10-12, 2000. Proceedings. 1841, 97-111. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1111