Primitive polynomials selection method for pseudo-random number generator

Anikin, Igor V.; Alnajjar, Kh

doi:10.1088/1742-6596/944/1/012003

Cited by 2 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We try to look for a suitable size for each buffer by investigating the relationship between the degree of the used primitive polynomial and the length of the linked buffer measured in bits. In [2], we have built a table containing the ranges of possible degrees regarding the selected value of m (the number of multiplicative terms in the polynomial expression) and t (the number of non-zero coefficients). As a result of this section, we add a new column to the built table containing the recommended sizes of the buffer.…”

Section: Studying the Relationship Between The Degree Of The Selectedmentioning

confidence: 99%

“…Table 1 contains the selected polynomials briefly described using the parameters (b 1 , b 2 , …, b m , n) of (1). 131-258 (1,5,7,15,29,129,191) 7 259-514 (1,2,4,8,16,33,193,419) 8 515-1026 (1,2,5,9,18,36,72,298,929) 9 1027-2050 (1,2,4,8,16,32,64,129,807,1163) To remove confusion, we write one these polynomials in its expanded form (2):…”

Section: Studying the Relationship Between The Degree Of The Selectedmentioning

confidence: 99%

“…It is worth mentioning that the obtained results are very worthy from the cryptanalysis point of view because it makes the developed generator more secure. (1,6,11,22,43) 48-64 5 67-130 (1,5,9,21,41,89) 40-64 6 131-258 (1,5,7,15,29,129,191) 40-64 7 259-514 (1,2,4,8,16,33,193,419) 32-64 8 515-1026 (1,2,5,9,18,36,72,298,929) 32-64 9…”

Section: Studying the Relationship Between The Degree Of The Selectedmentioning

confidence: 99%

“…A new step starts when FPRNG updates the contents of buffers by running the LFSRs one step. In [2], we studied the immunity of FPRNG against correlation attacks and explained the iterative tuning process of linguistic variables. The tuning process guarantees the security of the generated stream against correlation attacks because it takes into account the balance of the output stream.…”

Section: Introductionmentioning

confidence: 99%

“…We also proved that the suggested numerical method for selecting primitive characteristic polynomials for LFSRs practically improves the statistical properties of the generated bit stream and increases the performance of FPRNG. The chosen polynomials have the general form defined by equation 1and satisfy the specified conditions that we explained in detail in [2].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Secure Gamma Generation For Stream Cipher based on Fuzzy Logic

Alnajjar

Anikin

2020

2020 International Conference on Information Technology and Nanotechnology (ITNT)

View full text Add to dashboard Cite

In this paper, we propose a new approach for secure bit stream gamma generation based on the concept of fuzzy logic and linear feedback shift registers (LFSRs), combined in pseudorandom number generator based on fuzzy logic (FPRNG). The original idea for ensuring security for gamma generation is based on the initial states (the seeds) of LFSRs used in the generator. In this paper, we suggested the updated version of FPRNG. We also improve gamma security by accompaniment seed some valuable secure information. We found that configurations of membership functions (MFs) in FPRNG can significantly affect the randomness of the output stream of the developed generator. We can increase the gamma security as well as stream cipher security by keeping these configurations in secret additionally to seeds.

show abstract

Section: Studying the Relationship Between The Degree Of The Selectedmentioning

confidence: 99%

Section: Studying the Relationship Between The Degree Of The Selectedmentioning

confidence: 99%

Section: Studying the Relationship Between The Degree Of The Selectedmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Secure Gamma Generation For Stream Cipher based on Fuzzy Logic

Alnajjar

Anikin

2020

2020 International Conference on Information Technology and Nanotechnology (ITNT)

View full text Add to dashboard Cite

show abstract

Hardware Efficient Hybrid Pseudo-Random Bit Generator Using Coupled-LCG and Multistage LFSR with Clock Gating Network

Gupta¹,

Chauhan²,

Gulia³

2022

J CIRCUIT SYST COMP

View full text Add to dashboard Cite

A new method for the generation of pseudo-random bits, based on a coupled-linear congruential generator (CLCG) and two multistage variable seeds linear feedback shift registers (LFSRs) is presented. The proposed algorithm dynamically changes the value of the seeds of each linear congruential generator (LCG) by utilizing the multistage variable seeds LFSR. The proposed approach exhibits several advantages over the pseudo-random bit generator (PRBG) methods presented in the literature. It provides low hardware complexity and high-security strength while maintaining the minimum critical path delay. Moreover, this design generates the maximum length of pseudo-random bit sequence with uniform clock latency. Furthermore, to improve the critical path delay, one more architecture of PRBG is proposed in this work. It is based on the combination of coupled modified-LCG with two variable seeds multistage LFSRs. The modified LCG block is designed by the two-operand modulo adder and XOR gate, rather than the three-operands modulo adder and shifting operation, while it maintains the same security strength. The clock gating network (CGN) is also used in this work to minimize the dynamic power dissipation of the overall PRBG architecture. The proposed architectures are implemented using Verilog HDL and further prototyped on commercially available field-programmable gate array (FPGA) devices Virtex-5 and Virtex-7. The realization of the proposed architecture in this FPGA device accomplishes an improved speed of PRBG, which consumes low power with high randomness compared to existing techniques. The generated binary sequence from the proposed algorithms has been verified for randomness tests using NIST statistical test suites.

show abstract

Primitive polynomials selection method for pseudo-random number generator

Cited by 2 publications

References 6 publications

Secure Gamma Generation For Stream Cipher based on Fuzzy Logic

Secure Gamma Generation For Stream Cipher based on Fuzzy Logic

Hardware Efficient Hybrid Pseudo-Random Bit Generator Using Coupled-LCG and Multistage LFSR with Clock Gating Network

Contact Info

Product

Resources

About