Primitive polynomials selection method for pseudo-random number generator

被引:3
作者
Anikin, I. V. [1 ]
Alnajjar, Kh [1 ]
机构
[1] Kazan Natl Res Tech Univ, Kazan 420111, Russia
来源
XI INTERNATIONAL SCIENTIFIC AND TECHNICAL CONFERENCE - APPLIED MECHANICS AND DYNAMICS SYSTEMS | 2018年 / 944卷
关键词
D O I
10.1088/1742-6596/944/1/012003
中图分类号
O3 [力学];
学科分类号
08 ; 0801 ;
摘要
In this paper we suggested the method for primitive polynomials selection of special type. This kind of polynomials can be efficiently used as a characteristic polynomials for linear feedback shift registers in pseudo-random number generators. The proposed method consists of two basic steps: finding minimum-cost irreducible polynomials of the desired degree and applying primitivity tests to get the primitive ones. Finally two primitive polynomials, which was found by the proposed method, used in pseudorandom number generator based on fuzzy logic (FRNG) which had been suggested before by the authors. The sequences generated by new version of FRNG have low correlation magnitude, high linear complexity, less power consumption, is more balanced and have better statistical properties.
引用
收藏
页数:6
相关论文
共 16 条
[1]  
Anikin IV, 2016, IEEE INT SIBER CONF
[2]  
Anikin IV, 2015, P INT SIB C CONTR CO
[3]  
Brillhart J, 1988, AM MATH SOC, V22
[4]  
Cohen E, P AM MATH SOC, V11, P164
[5]  
Heringa J. R., 1992, International Journal of Modern Physics C (Physics and Computers), V3, P561, DOI 10.1142/S0129183192000361
[6]   PRIMITIVE T-NOMIALS (T = 3,5) OVER GF(2) WHOSE DEGREE IS A MERSENNE EXPONENT LESS-THAN-OR-EQUAL-TO 44497 [J].
KURITA, Y ;
MATSUMOTO, M .
MATHEMATICS OF COMPUTATION, 1991, 56 (194) :817-821
[7]  
Lang-Terng Wang, 2011, UTCERC1203
[8]   GENERALIZED FEEDBACK SHIFT REGISTER PSEUDORANDOM NUMBER ALGORITHM [J].
LEWIS, TG ;
PAYNE, WH .
JOURNAL OF THE ACM, 1973, 20 (03) :456-468
[9]  
Lidl R, 1983, MATH APPL, V20