Analysis of 90/150 Two Predecessor Nongroup
Sung‐Jin Cho, Un-Sook Choi, H an-Doo Kim, Yoon-Hee Hwang, Jin-Gyoung Kim · 2008
Many researchers have been studied synthesis method of 90/150 group CA. However, there is a lack of researches for synthesis method of 90/150 nongroup CA. In this paper we propose an algorithm for finding 90/150 Two Predecessor Cellular Automata. Using the pro- posed algorithm we analyze 90/150 two predecessor CA. Especially, we analyze 90/150 TPSACA and TPMACA which are useful to study hash- ing. Also we analyze two types of 90/150 two predecessor CA. One is two predecessor CA for the minimal polynomial whose type is of the form xp(x) which is useful to study two predecessor CA whose depth is 1. Another is two predecessor CA for the minimal polynomial whose type is of the form x(x +1 )p(x) which is useful to study pseudorandom number generation based on 90/150 two predecessor CA, where p(x )i s some primitive polynomial.