Chaotic Cryptosystems: Cryptanalysis and Identifiability
| Autor: | F. Anstett, G. Bloch, Gilles Millérioux |
|---|---|
| Přispěvatelé: | Centre de Recherche en Automatique de Nancy (CRAN), Université Henri Poincaré - Nancy 1 (UHP)-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS) |
| Rok vydání: | 2006 |
| Předmět: |
Chaotic cryptosystems
0209 industrial biotechnology Polynomial Theoretical computer science Chaotic Cryptography 02 engineering and technology 01 natural sciences known plaintext attack 010305 fluids & plasmas law.invention 020901 industrial engineering & automation cryptanalysis Brute-force attack law [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering Computer Science::Multimedia 0103 physical sciences Applied mathematics Cryptosystem Electrical and Electronic Engineering Computer Science::Cryptography and Security Mathematics business.industry identifiability 16. Peace & justice Known-plaintext attack [NLIN.NLIN-CD]Nonlinear Sciences [physics]/Chaotic Dynamics [nlin.CD] Identifiability brute force attack business Cryptanalysis algebraic attack |
| Zdroj: | IEEE Transactions on Circuits and Systems-Part I IEEE Transactions on Circuits and Systems-Part I, ieee, 2006, 53 (12), pp.2673-2680. ⟨10.1109/TCSI.2006.885979⟩ |
| ISSN: | 1057-7122 |
| Popis: | A general framework based on the identifiability concept for the cryptanalysis of a large class of chaotic cryptosystems is proposed. A systematic methodology is provided, in order to test, a priori, during the design stage, whether the parameters of a chaotic cryptosystem may play the role of the secret key or not. A connection between robustness against brute force attacks, uniqueness in the parameters and identifiability is pointed out. Two approaches, the outputs equality approach and the input/output relation approach, are presented to test the identifiability of the system parameters. The second approach is constructive in the sense that not only it allows to conclude on the identifiability of the parameters but it also provides a systematic technique, based on solving a set of algebraic equations, to retrieve the parameters in the context of a known plaintext attack. It turns out that cryptosystems involving polynomial nonlinearities, chaotic or not, are weak against such an attack, called algebraic attack |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|