Cryptographically Secure Linear feedback shift
نویسنده
چکیده
ISSN: 2278 – 1323 All Rights Reserved © 2014 IJARCET 3504 Abstract— True random bit generator requires a naturally occurring source of randomness. Designing a hardware device or software program to exploit this randomness and produce a bit sequence that is free of biases and correlation is difficult task. For most cryptographic applications, the generator must not be subject to observation or manipulation by an adversary. So pseudorandom bit generator (PRNG) is used to create a sequence of bits that appear to random but not exactly random. As the word ‘pseudo’ suggest, these are not random some algorithms that use mathematical formulae or simply pre-calculated tables are used to produce sequence of number that appear random. A cryptographically secure pseudo random number generator (CSPRNG) is a PRNG with properties that make it suitable for use in cryptography. In this paper a modified version of linear feedback shift register (LFSR) is generated which will satisfy the requirement of cryptographically secure PRNG.
منابع مشابه
On cryptographic properties of LFSR-based pseudorandom generators
Pseudorandom generators (PRGs) are used in modern cryptography to transform a small initial value into a long sequence of seemingly random bits. Many designs for PRGs are based on linear feedback shift registers (LFSRs), which can be constructed in such a way as to have optimal statistical and periodical properties. This thesis discusses construction principles and cryptanalytic attacks against...
متن کاملSignal Processing Techniques in Cryptography
Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness characteristics of cryptographic sequences are analyzed, resulting in new methods for constructing sequences with high linear complexity. Connections between nonlinear complexity and other cryptographic criteria are also established, whereas a new recursive algorithm for efficiently computing the minimal ...
متن کاملOn the Randomness of the Editing Generator
In their paper, G.Gong and S.Q.Jiang construct a new pseudorandom sequence generator by using two ternary linear feedback shift registers (LFSR). The new generator is called an editing generator which a combined model of the clock-controlled generator and the shrinking generator. For a special case (Both the base sequence and the control sequence are mm-sequence of degree n), the period, linear...
متن کاملComplexity Measures of Cryptographically Secure Boolean Functions
In stream cipher cryptography a pseudorandom sequence of bits of length equal to the message length is generated. This sequence is then bitwise XORed (addition modulo 2) with the message sequence and the resulting sequence is transmitted. At the receiving end, deciphering is done by generating the same pseudorandom sequence and bitwise XORing the cipher bits with the random bits. The seed of th...
متن کاملInterleaved Sequences of Geometric Sequences Binarized with Legendre Symbol of Two Types
A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is a linear feedback shift register sequence with maximal period over a finite field. M-sequences have good statistical properties, however we must nonlinearize...
متن کامل