Hardware Trojans detection in chaos-based cryptography
| Autor: | Pawel Sniatala, Wieslaw Marszalek, Michał Melosik |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Generator (computer programming)
Computer Networks and Communications business.industry Computer science General Engineering Cryptography 02 engineering and technology 01 natural sciences Atomic and Molecular Physics and Optics 010305 fluids & plasmas 020202 computer hardware & architecture CHAOS (operating system) Artificial Intelligence 0103 physical sciences 0202 electrical engineering electronic engineering information engineering business Computer hardware Information Systems |
| Zdroj: | Bulletin of the Polish Academy of Sciences Technical Sciences. 65:725-732 |
| ISSN: | 2300-1917 |
| Popis: | The paper deals with the security problems in chaotic-based cryptography. In particular, the 0–1 test for chaos is used to detect hardware Trojans in electronic circuits – generators of chaotic bit sequences. The proposed method of detecting hardware Trojans is based on analyzing the original bit sequences through the 0–1 test yielding a simple result, either a number close to 1, when the examined bit sequence is chaotic, or a number close to 0, when the sequence is non-chaotic. A complementary result is a graph of translation variables qc and pc which form a basis of the 0–1 test. The method does not require any extra corrections and can be applied to relatively short sequences of bits. This makes the method quite attractive as the security problems are dealt with at the chaotic generator level, with no need to apply any extractors of randomness. The method is illustrated by numerical examples of simulated Trojans in chaotic bit generators based on the analog Lindberg circuit as well as a discrete system based on the logistic map. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|