Pseudo-random number generation applied to robust modern cryptography: A new technique for block ciphers

Latest mitigation techniques proposed at register-transfer level for dependable cryptosystems deal with time redundancy in an active on-line error-detection scheme. Round-based block ciphers are very likely to be hardened with these techniques. Although good results are achieved in terms of area or...

Full description

Saved in:
Bibliographic Details
Main Authors: Jimenez-Horas, A., San Millan, E., Lopez-Ongil, C., Portela-Garcia, M., Garcia-Valderas, M., Entrena, L.
Format: Conference Proceeding
Language:English
Subjects:
Circuit faults
Computer hacking
Cryptography
Data mining
Electrical fault detection
Fault detection
Hardware
Protection
Redundancy
Robustness
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Latest mitigation techniques proposed at register-transfer level for dependable cryptosystems deal with time redundancy in an active on-line error-detection scheme. Round-based block ciphers are very likely to be hardened with these techniques. Although good results are achieved in terms of area or time overhead, intentional attacks are still able to obtain crucial information by means of intensive fault injection campaigns. In this paper, a new solution is presented and analyzed, dealing with pseudo-random number generators (PRNG) with the goal of misleading attackers and, therefore, making cryptosystem more robust. With this approach, attackers must face two difficulties: dealing with on-line error detection and ignoring the fault location in the round sequence. PRNG will produce different repetition sequences for the rounds of the cryptosystem, making very difficult to correlate output data with injected faults.
ISSN:1942-9398
1942-9401
DOI:10.1109/IOLTS.2009.5196014