Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Protection against EEPROM modification attacks

W. W. FungContact Information and J. W. Gray IIIContact Information

(1)  Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
(2)  RSA Laboratories West, 100 Marine Parkway, Suite 500, 94065-1031 Redwood City, CA, USA
Abstract
In recent work, Anderson and Kuhn described an attack against tamperproof devices wherein a secret key stored in EEPROM is compromised using a simple and low-cost attack. The attacker uses low-cost probes to set individual EEPROM bits to 0 or 1 and observes the effect on the output of the device. These attacks are extremely general, as they apply to virtually any cryptosystem. In this paper we explore high-level design techniques with the goal of providing some degree of protection against these attacks. We describe a cascaded m-permutation protection scheme that uses an (m × n)-bit encoding for an n-bit key and for which the best known attack requires O(nm) probes to compromise the key. Although the attack is of polynomial time complexity, it would be impractical to apply it when the protection scheme uses 5 or more cascaded permutations of a 128-bit key; in particular, in this case, the best known attack requires approximately 3.4 × 109 manual probes.

Contact Information W. W. Fung
Email: wwfung@cs.ust.hk

Contact Information J. W. Gray III
Email: Jgray@rsa.com
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.107 • Server: mpweb04
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)