TL;DR: The letter presents a cryptographically secure pseudorandom sequence generator where two prime numbers are arbitrary, based on the public key cryptosystem proposed by one of the authors.
Abstract: The letter presents a cryptographically secure pseudorandom sequence generator where two prime numbers are arbitrary, based on the public key cryptosystem proposed by one of the authors.
TL;DR: DPA attack of Trivium exploits the re-synchronization phase of the algorithm to reveal the key.
Abstract: Trivium is a hardware oriented synchronous stream cipher designed by Christophe De Canniere and Bart Preneel [7]. Trivium is one of the eSTREAM final portfolio cipher. Regardless of the security of the cipher in theory, implementation attacks like Differential Power Analysis (DPA) attack [10, 12, 18] and Fault attack [9] on Trivium were observed. DPA attack of Trivium exploits the re-synchronization phase of the algorithm to reveal the key.
TL;DR: The main aim of this paper is to design hardware efficient secure communication system to avoid redundancy in cryptography primitives and to design secure stream ciphers based on EC point multiplication.
Abstract: The main aim of this paper is to design hardware efficient secure communication system. To design a secure communication system of low hardware complexity, one method is to avoid redundancy in cryptography primitives. The method used for encryption can be either a stream cipher or block cipher. But the hardware complexity of a stream cipher is much less than that of a block ciphers. Hence in a secure communication system of low hardware complexity, stream cipher is a suitable method in order to reduce redundant hardware for the implementation of some other cryptographic service in time sharing way in the system. The key exchange and encryption are two sequential operations and a popular standard used for key exchange is Elliptic Curve (EC) based method. Most critical step in the design of stream cipher is the design of a Cryptographically Strong Pseudorandom Bit Sequence Generator (CSPBSG). This PBSG is implemented based on Elliptic Curve (EC). The main complex hardware block in Elliptic Curve Pseudorandom Bit Sequence Generator (ECPBSG) is EC point multiplication block. The computational complexity of the EC point multiplication is reduced by using normal basis representation for elements of GF (2m). The GF multiplier structure used in implementation of EC point multiplication is chosen such that the overall hardware complexity is low. It is possible to design secure stream ciphers based on EC point multiplication. Hence this paper completely concentrates on hardware efficiency, in the implementation of secure communication system.
TL;DR: It is proved through power spectrum analysis that the pseudorandom sequence with long-period cant effectively conceal message characteristics in frequency-domain.
Abstract: Classical cryptography theory holds that the true random sequence is better than any pseudorandom sequence on the security of stream cipher. So people prefer the pseudorandom sequence with long-period to the pseudorandom sequence with short-period. In this paper, it is proved through power spectrum analysis that the pseudorandom sequence with long-period cant effectively conceal message characteristics in frequency-domain. To combine the pseudorandom sequences with long cycle and short cycle may be the better encryption key.
TL;DR: The statistic testing proves the pseudo-randomness of the output bits of the NSumSG and applicability of the N-adic Summation-Shrinking Generator as a real stream cipher.
Abstract: The paper describes the software application of a scheme of stream cipher named N-adic Summation-Shrinking Generator (NSumSG). The statistic testing proves the pseudo-randomness of the output bits of the NSumSG and applicability of the NSumSG as a real stream cipher.