90/150 TPNCA의 합성과 분석

Abstract

In this thesis, using algorithm for finding 90/150 Two Predecessor Nongroup Cellular Automata(TPNCA) and analyzing 90/150 TPNCA. In particular we analyze n-cell 90/150 Two Predecessor Single Attractor CA(TPSACA) whose minimal polynomial is x^(n) and n-cell Two Predecessor Multiple Attractor CA(TPMACA) whose minimal polynomial is x^(n-1)(x+1) which are useful to study hashing. Also we analyze two types of 90/150 TPNCA. One is TPNCA for the minimal polynomial whose type is of the form xp(x), where p(x) is a primitive polynomial of degree n-2. Another is TPNCA for the minimal polynomial whose type is of the form x(x+1)p(x), where p(x) is a primitive polynomial of degree n-1.