2009Journal of CommunicationsRequires access

The "one-group-one-cipher" cryptograph of block-cipher based on chaotic

Yan Ji-ning

Open publisher page 5 citations

Abstract

Theone-group-one-cipheralgorithm used the sequence from chaotic mapping as sub-key for block cipher was presented to solve the problem of weak keys existing in currently combined cipher algorithms.The randomness of abstracted key sequence was validated in aspects of Shannon entropy.Theone-group-one-cipheralgorithm was de-signed and implemented based on hyper-chaos generalized Henon mapping and IDEA algorithms, and its security was analyzed theoretically.Analysis shows that the algorithm is so secure that it can withstand brute force attack, and it was perfect secrecy.The disadvantages of key's reuse of block ciphers are avoided, and the practicality and feasibility of chaos ciphers and one-time pad are improved.

About this research paper

What this paper is about

Theone-group-one-cipheralgorithm used the sequence from chaotic mapping as sub-key for block cipher was presented to solve the problem of weak keys existing in currently combined cipher algorithms.The randomness of abstracted key sequence was validated in aspects of Shannon entropy.Theone-group-one-cipheralgorithm was de-signed and implemented based on hyper-chaos generalized Henon mapping and IDEA algorithms, and its security was analyzed theoretically.Analysis shows that the algorithm is so secure that it can withstand brute force attack, and it was perfect secrecy.The disadvantages of key's reuse of block ciphers are avoided, and the practicality and feasibility of chaos ciphers and one-time pad are improved.

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Theone-group-one-cipheralgorithm used the sequence from chaotic mapping as sub-key for block cipher was presented to solve the problem of weak keys existing in currently combined cipher algorithms.The randomness of abstracted key sequence was validated in aspects of Shannon entropy.Theone-group-one-cipheralgorithm was de-signed and implemented based on hyper-chaos generalized Henon mapping and IDEA algorithms, and its security was analyzed theoretically.Analysis shows that the algorithm is so secure that it can withstand brute force attack, and it was perfect secrecy.The disadvantages of key's reuse of block ciphers are avoided, and the practicality and feasibility of chaos ciphers and one-time pad are improved.

Key concepts: Block cipher, Stream cipher, Cipher, Running key cipher, Computer science, Theoretical computer science, Cryptography, CBC-MAC

Related papers

Back to paper searchBrowse research topicsOriginal source
The "one-group-one-cipher" cryptograph of block-cipher based on chaotic — Research Paper | ScholarLens