Secure and fast encryption using chaotic Kolmogorov flows

Author

Scharinger, Josef

Author_Institution

Inst. of Syst. Sci., Johannes Kepler Univ., Linz, Austria

fYear

1998

fDate

22-26 Jun 1998

Firstpage

124

Lastpage

125

Abstract

We describe a new symmetric product ciphering algorithm that operates iteratively on an arbitrary square block of plaintext with the only constraint that the blocklength has to be an integral power of 2. Permutations are induced by the highly unstable nonlinear dynamics of chaotic Kolmogorov flows, while substitutions are implemented using add-with-carry or subtract-with-borrow generators. The encryption performance is excellent in hardware and software which is based on the fact that only additions, subtractions and bit-shifts, but no time-consuming operations like multiplication or exponentiation are necessary for implementing the cipher

Keywords

chaos; cryptography; digital arithmetic; stability; add-with-carry generator; additions; bit-shifts; blocklength; chaotic Kolmogorov flows; fast encryption; hardware; performance; permutations; secure encryption; software; square block; substitutions; subtract-with-borrow generator; subtractions; symmetric product ciphering algorithm; unstable nonlinear dynamics; Chaos; Cryptography; Fusion power generation; Iterative algorithms; Security; Software performance; State-space methods; Statistical analysis; Strips; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop, 1998

Conference_Location

Killarney

Print_ISBN

0-7803-4408-1

Type

conf

DOI

10.1109/ITW.1998.706468

Filename

706468