A New Development of Symmetric Key Cryptosystem

Yang, Xiao; Boussakta, S.

doi:10.1109/icc.2008.299

Cited by 11 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thereafter, a complete encryption process requires 168 shifts and 896 additions. Yang and Boussakta proposed an encryption algorithm with FNTT [33], in which the diffusion layer required 660 additions.…”

Section: Discussion On Complexitymentioning

confidence: 99%

A Complexity-Reduced Block Encryption Algorithm Suitable for Internet of Things

et al. 2019

View full text Add to dashboard Cite

The Internet of Things (IoT) poses stringent requirements on service quality and security strength. A highly reliable encryption algorithm with low complexity is required to ensure information security. Therefore, this paper proposes a complexity-reduced secure and fast encryption routine (SAFER)-Fermat block encryption method that accounts for the confusion and diffusion principles. In particular, a novel diffusion layer that exploiting the Fermat number theory transform is proposed, while the confusion layer remains unchanged as the SAFER algorithm. We also propose two data record structures to accommodate the two layers and deal with the overflow issue. The proposed scheme only considers the integer operation, the inclusion of multipliers in our study is no longer necessary, thereby resulting in low complexity and lightweight encryption method. Therefore, the proposed encryption method is advantageous for power-limited IoT devices. The simulations demonstrate that the proposed encryption method maintains the security of the SAFER++ method but requires fewer computations.INDEX TERMS Internet of things, block encryption, Fermat number theory transform, computational Complexity.

show abstract

Section: Discussion On Complexitymentioning

confidence: 99%

A Complexity-Reduced Block Encryption Algorithm Suitable for Internet of Things

et al. 2019

View full text Add to dashboard Cite

show abstract

“…NTTs use modular arithmetic operations on a field or ring of integers, without the errors inherent to normal floating-point operations, such as those found in the Discrete Fourier Transform (DFT) for example. NTTs have wide applications in different areas including; digital signal processing (Agarwal, 1980), digital filtering (Agarwal and Burrus, 1974;Boussakta and Holt, 1994), image processing (Boussakta and Holt, 1999), decoding (Reed et al, 1978) and cryptography (Yang et al, 2010;Yang and Boussakta, 2008).…”

Section: New Mersenne Number Transform (Nmnt)mentioning

confidence: 99%

New Mersenne Number Transform Diffusion Power Analysis

J.¹

2011

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

Problem statement: Due to significant developments in the processing power and parallel processing technologies, the existing encryption algorithms are increasingly susceptible to attacks, such as side-channel attacks, for example. Designing new encryption algorithms that work efficiently on different platforms and security levels to protect the transmitted data from any possible attacks is one of the most important issues in today's information and network security. The aim is to find more secure, reliable and flexible systems that can run as a ratified standard, with reasonable computational complexity for a sufficient service time. To expand the longevity of the algorithm, it is important to be designed to work efficiently on a variety of block sizes and key lengths according to the security demand. A sensible solution is the suggested use of a parameter transform. Approach: The present study evaluates the appropriateness of the New Mersenne Number Transform for security applications by analyzing and estimating its avalanche and diffusion power. Results: The results confirm that the transform in general reflects good avalanche characteristics that are for most cases over 50% and can be up to 100%. The lower bound can be further improved by increasing the modulus and/or the transform length. Conclusion: This New Mersenne Number Transform is highly flexible and adaptable for this application. It can be involved in the design of a secure cryptosystem for the following reasons; changing a single input element makes drastic changes in the output elements and vice versa (sensitivity), provides variable block size and key length (parameterization). Has long transform length (power of two), is error free and its inverse is the same with a scale factor of (1/N) which simplifies implementation of both encryption and decryption. Finally, it is appropriate for real time implementations such as fast algorithms, which can be applied to it, to speed up processing.

show abstract

“…2 Generally, NTT is a linear orthogonal transformation defined on the modulo-M integer ring, and its main operation is arithmetic congruence in the number theory. 5 Among all NTTs, there are two kinds of transform attracted much attentions, ie, the Fermat number transform (FNT) and the Mersenne number transform (MNT). 3 Accordingly, there had been some applications in the image compressing 4 and encryption.…”

Section: Introductionmentioning

confidence: 99%

“…3 Accordingly, there had been some applications in the image compressing 4 and encryption. 5 Among all NTTs, there are two kinds of transform attracted much attentions, ie, the Fermat number transform (FNT) and the Mersenne number transform (MNT). The reason is that they can realize a simple modulo operation through the ones complement representation.…”

Section: Introductionmentioning

confidence: 99%

A fast realization of new Mersenne number transformation and its applications

Hua

Liu

et al. 2019

Circuit Theory & Apps

View full text Add to dashboard Cite

The new Mersenne number transform (NMNT) can be realized by the fast Fourier transform (FFT) with power-of-two length, which results in great flexibility in real-world fixed-point computations, such as the convolution-based signal processing in the embedded device. Yet the FFT realization exists the truncation errors and in order to further reduce the computations, this paper puts forward a novel realization structure for the NMNT, where the Walsh-Hadamard transform (WHT) is employed to accelerate the NMNT computation. Moreover, we also propose the refined computing structure using the matrix decomposition and multiple constant multiplication (MCM), and then all multiplications can be replaced by the shift-addition operations without precision loss. Besides, the use of lookup table (LUT) to reduce the complexity is also discussed in our study. A typical convolution application is tested by computer simulations, while the result demonstrates that the proposed scheme produces precise computing results with reduced complexity. KEYWORDS computing complexity, fast realization, Walsh-Hadamard new mersenne number transform, Walsh Hadamard transform 738

show abstract

A New Development of Symmetric Key Cryptosystem

Cited by 11 publications

References 6 publications

A Complexity-Reduced Block Encryption Algorithm Suitable for Internet of Things

A Complexity-Reduced Block Encryption Algorithm Suitable for Internet of Things

New Mersenne Number Transform Diffusion Power Analysis

A fast realization of new Mersenne number transformation and its applications

Contact Info

Product

Resources

About