2011•Fuzhou daxue xuebao. Ziran kexue banRequires access

An encryption algorithm based on dynamic loop substitution table

XU Rong-cong

Open publisher page 0 citations

Abstract

An encryption algorithm based on dynamic loop substitution table is proposed after study of monoalphabetic substitution cipher,which combines the idea of byte swap and cyclic shift.The initial substitution table of this encryption algorithm is two 256-byte random permutation generated by two different pseudo-random number generator.The initial state of the substitution table is determined by the key.In addition,in the design of the encryption algorithm,elliptic curve cryptosystems(ECC) is introduced to solve the key management problem.The management of keys,the efficiency of data processing,the security and the weakness of the encryption algorithm are also analyzed.The results show that the encryption algorithm can resist many attacks effectively and has a good security.

About this research paper

What this paper is about

An encryption algorithm based on dynamic loop substitution table is proposed after study of monoalphabetic substitution cipher,which combines the idea of byte swap and cyclic shift.The initial substitution table of this encryption algorithm is two 256-byte random permutation generated by two different pseudo-random number generator.The initial state of the substitution table is determined by the key.In addition,in the design of the encryption algorithm,elliptic curve cryptosystems(ECC) is introduced to solve the key management problem.The management of keys,the efficiency of data processing,the security and the weakness of the encryption algorithm are also analyzed.The results show that the encryption algorithm can resist many attacks effectively and has a good security.

Why it matters

A significance statement is not available in the OpenAlex record.

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

An encryption algorithm based on dynamic loop substitution table is proposed after study of monoalphabetic substitution cipher,which combines the idea of byte swap and cyclic shift.The initial substitution table of this encryption algorithm is two 256-byte random permutation generated by two different pseudo-random number generator.The initial state of the substitution table is determined by the key.In addition,in the design of the encryption algorithm,elliptic curve cryptosystems(ECC) is introduced to solve the key management problem.The management of keys,the efficiency of data processing,the security and the weakness of the encryption algorithm are also analyzed.The results show that the encryption algorithm can resist many attacks effectively and has a good security.

Key concepts: Encryption, Computer science, Probabilistic encryption, Algorithm, Multiple encryption, 40-bit encryption, 56-bit encryption, Substitution (logic)

Related papers

Back to paper searchBrowse research topicsOriginal source
An encryption algorithm based on dynamic loop substitution table — Research Paper | ScholarLens