TY  - JOUR
T1  - Finite Field Expansion Methods for the More Secure
Information Protecting Code
AU - An, Hyeong-Keon 
JO  - Journal of Engineering and Applied Sciences
VL  - 13
IS  - 5
SP  - 1115
EP  - 1117
PY  - 2018
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2018.1115.1117
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2018.1115.1117
KW  - Reed Solomon
KW  -zero crossing detector
KW  -VHDL
KW  -asymmetric encription
KW  -cyphertext
KW  -GF(216)
KW  -internet data
AB  - We show the method of expanding the order of the finite field. As the order becomes bigger and
bigger, the more powerful security code comes out, since, the encrypting code becomes the more and more
difficult to decript. This is because the number of the occurring cases is exponentially increasing as the order
of the primitive equation of the finite field is increasing. In this study, we show the method to expand the finite
field length. Especially, the zero crossing detector is designed and designing method is precisely described.
ER  -