西华大学学报（自然科学版）2017，Vol.36Issue(1)：12-16,5.DOI:10.3969/j.issn.1673-159X.2017.01.003
基于CF(pn)的CCA安全ElGamal加密体制
CCA Secure Extended ElGamal Encryption Scheme Over CF( pn)
摘要
Abstract
This subject investigates the discrete logarithm problem over finite field CF ( pn ) , proposes a ElGamal encryption scheme over finite field CF( pn ) , and proves that proposed the scheme satisfies IND-CCA security without oracle model. Futhermore, the size of algorithm' s security parameter k is contingent on prime p and polymonial degree n, which define the finite field CF( pn ) . The method alters the status in which traditional ElGamal algorithm security only relies on size of big prime p. We not only utilize C laguage to implement ElGamal algorithm over finite field CF(2n),but also ElGamal algorithm over finite field CF(2n) could be imple-mented by simple operations such as xor and shifting in aspect of programing implement. By means of comparing efficiencies with other exist schemes, such as RSA, traditional ElGamal, ECC, and AES algorithm. Then, we found that ElGamal algorithm over finite field CF(2n) runs 1000 times faster than traditional ElGamal algorithm, three times faster than RSA, and 2000 times faster than ECC.关键词
CF(pn)有限域/IND-CCA/安全参数/ElGamal加密方案/效率Key words
finite field CF( pn )/IND-CCA/secure parameter/ElGamal encryption scheme/efficiencies分类
信息技术与安全科学引用本文复制引用
谭双权,何明星,曾晟珂,石坤..基于CF(pn)的CCA安全ElGamal加密体制[J].西华大学学报（自然科学版）,2017,36(1):12-16,5.基金项目
国家自然科学基金项目( 61402376、U1433130 ) （ 61402376、U1433130 ）
教育部春晖计划项目( Z2014045 ) （ Z2014045 ）
西华大学研究生创新基金项目(ycjj2015192). （ycjj2015192）
