New Pseudorandom Number Generator Artin-Schreier Tower for p=5
The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree.Therefore,it is difficult to apply for the construction of huge finite fields.To avoid this problem,we propose a new method to construct huge finite fields with the characteristic p =5 by using an Artin-Schreier tower.Utilizing the recursive basis of the Artin-Schreier tower,we define a multiplication algorithm.The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower,without any primitive element.We also define a linear recurrence equation as an application,which produces a sequence of numbers,and call the new pseudorandom number generator Abstract Syntax Tree (AST) for p =5.The experimental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.
finite field pseudorandom number generator AST long period
Song Huiling
Department of Mathematics,Faculty of Foundation,Harbin Finance University,Harbin 150030,P.R.China
国内会议
福州
英文
60-67
2012-10-27（万方平台首次上网日期，不代表论文的发表时间）