Um método de encriptação simétrica baseada em caos

Abstract

Historically, one-time pad is the only cipher that can be mathematically proven to be unbreakable. However provide the highest level of security if properly used, one-time pad has some drawbacks that inhibit its widespread use, the most prominent being the distribution of truly random sequences (keys) that should be at least as long as the message to be encrypted and should be used only once (hence the origin the nickname one-time). To counteract this difficulty, one can at first make use of pseudo-random sequences (which are reproducible). In order to provide such sequences, chaotic functions may be used, so that a priori transmission of the entire (key) sequence is not necessary before the communication process begins, requiring only little information and/or parameters such as: chaotic map to be used and initial value. Thus, the present work proposes a new symmetric stream cipher based on chaotic functions (one-dimensional) and the game of chaos. In order to verify if the methodology employed is suitable for cryptographic use, several statistical test suites are employed since cryptanalysis will be left for another moment.