摘要
分析了GF(2n)域上基于优化正规基(ONB)的椭圆曲线的运算法则,讨论了域划分对芯片实现速度和硬件资源占用二者的影响,设计了一种串-并行结构的基于ONB的高速有限域运算单元,用于完成GF(2191)域上基于ONB的ECC芯片实现,在50MHz时钟下,GF(2191)域上的点乘运算速度平均为981次/s。
Based on optimal normal basis in GF(2^n), a high speed serial-parallel elliptic curve multiplier is proposed in the paper, through introduction of operation rules in GF(2^n), elliptic curves and point operation rules, with emphasis on the discussion of the ECC chip speed and hardware resource consuming, which is induced by different field partitions. The rate of point multiply is about 981 per second after FPGA validation.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第9期168-170,共3页
Computer Engineering
关键词
椭圆曲线
优化正规基
点乘运算
ECC
Elliptic curve
Optimal normal base
Point multiplication operation
ECC