In this paper, we propose a multiplication scheme based on cellular automata and propose high speed multiplication scheme and exponentiation scheme using a optimal normal basis. And then EIGamal signature scheme is implemented by proposed schemes. A proposed multiplication and exponentiation scheme based on cellular automata can be used in restricted computing environments such that basis is frequently changed and cryptosystem and multimedia applications that are required high speed operations.
목차
ABSTRACT I. 서론 II. 최적정규기저 표현과 셀룰라 오토마타 1. 최적정규기저(optimal nomal basis) 2. 셀룰라 오토마타(cellular automata) III. 셀룰라 오토마타를 이용한 연산 구조 1. 곱셈 알고리즘 2. 역승 연산과 역원 IV. EIGamal 서명 기법 1. 키 생성 2. 서명 생성 3. 서명 검증 V. 결론 참고문헌