Sciweavers

MASCOTS
2001
13 years 3 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement
WAIFI
2010
Springer
192views Mathematics» more  WAIFI 2010»
13 years 7 months ago
Type-II Optimal Polynomial Bases
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
Daniel J. Bernstein, Tanja Lange
APCCAS
2006
IEEE
292views Hardware» more  APCCAS 2006»
13 years 8 months ago
Another Look at the Sequential Multiplier over Normal Bases
—The Massey-Omura multiplier is a well-known sequential multiplier over finite fields GF(2m ), which can perform multiplication in m clock cycles for the normal basis. In this ar...
Zih-Heng Chen, Ming-Haw Jing, Trieu-Kien Truong, Y...
ISCAS
2008
IEEE
287views Hardware» more  ISCAS 2008»
13 years 8 months ago
A high speed word level finite field multiplier using reordered normal basis
— Reordered normal basis is a certain permutation of a type II optimal normal basis. In this paper, a high speed design of a word level finite field multiplier using reordered ...
Ashkan Hosseinzadeh Namin, Huapeng Wu, Majid Ahmad...