Please use this identifier to cite or link to this item:

Protection of Keys Against Modification Attack

Authors Fung, W.W.
Golin, Mordecai J View this author's profile
Issue Date 2001
Source Lecture Notes in Computer Science , v. 1438, 1998, p. 250-260
Summary In recent work, Anderson and Kuhn [3] described an attack against tamper-resistant devices wherein a secret key stored in EEPROM is compromised using a simple and lowcost attack. The attack consists of setting bits in the EEPROM using low-cost probes and observing the effect on the output of the device. These attacks are extremely general, as they apply to virtually any cryptosystem. The objective of the present work is to explore cryptographic techniques with the goal of raising the cost (in terms of time and money) of carrying out the EEPROM modification attack by Class I attackers, at least to a point where it is as prohibitive as the cost of purchasing more expensive equipment. We propose the m-permutation protection scheme in which the key will be encoded in a special way and burned into the EEPROM of the device. To attack the scheme, the attacker needs to be able to solve for K in the equation K = ⊕mi=1 Pi in which Pi’s are unknown. It is observed that the m-permutation protection scheme does not distribute the key K uniformly. Analysis shows that m = 3 or m = 5 are already good enough practically to provide strong security if the encoding is done properly and that m > 5 may not give significant improvement to the security of the scheme.
Note 3rd Australasian Conference on Information Security and Privacy, ACISP 1998, Brisbane, Australia, 13 July 1998 through 15 July 1998, Code 148389
ISSN 0302-9743
ISBN 3540647325
Language English
Format Technical report
Access View full-text via Scopus
Files in this item:
File Description Size Format
200104.pdf 148932 B Adobe PDF