Symmetric Encryption Schemes Based On Non-Deterministic Random Numbers And Chaotic Maps

Loading...
Thumbnail Image
Date
2017-05
Authors
Teh, Je Sen
Journal Title
Journal ISSN
Volume Title
Publisher
Universiti Sains Malaysia
Abstract
Symmetric encryption provides data confidentiality. However, it is susceptible to statistical-based cryptanalytic attacks. Ciphers can be attacked due to their deterministic nature, which maps each plaintext to one ciphertext for the same inputs. To address this issue, this research proposes new symmetric encryption schemes which integrate true random number generators (TRNGs). This results in ciphertexts that are randomized even when the plaintext and secret key are both constant. However, TRNGs are generally slow and require specialized hardware to extract entropy from physical phenomena. For the resulting encryption schemes to have good performance, TRNGs based on existing computing hardware are developed in this research. These generators are designed to outperform existing TRNGs with the same entropy sources. Chaotic maps are used to design the encryption schemes and TRNGs due to their high sensitivity to parameter changes and pseudorandom behaviour. The proposed TRNGs depict good performance and no statistical defects. A concrete authenticated block cipher and a stream cipher are designed as proof-of-concepts for the proposed encryption schemes. Results show that the ciphers are resistant to statistical-based cryptanalysis. When implemented with TRNGs, the proposed ciphers have increased immunity against these attacks. Thus, the proposed symmetric encryption schemes are practical alternatives to current encryption standards especially when immunity against cryptanalysis is required.
Description
Keywords
New symmetric encryption schemes , which integrate true random number generators
Citation