A new hardware architecture for operations in GF(2n)

IEEE Transactions on Computers

Volumn 51, Issue 1, 2002, Pages 90-92

  Kim, Chang Han ^a   Oh, Sangho ^b   Lim, Jongin ^b  

^a Semyung University   (South Korea)

^b Korea University   (South Korea)

Author keywords

Elliptic curve; Finite fields; Nonconventional basis; Public key cryptosystems

Indexed keywords

CALCULATIONS; DIGITAL ARITHMETIC; MATRIX ALGEBRA; POLYNOMIALS; PUBLIC KEY CRYPTOGRAPHY; SET THEORY; THEOREM PROVING; VECTORS;

BIT-PARALLEL MULTIPLIER; ELLIPTIC CURVE CRYPTOSYSTEMS; FINITE FIELDS; MASSEY-OMURA MULTIPLIER; NONCONVENTIONAL BASIS; NORMAL BASIS REPRESENTATION; POLYNOMIAL BASIS REPRESENTATION;

MULTIPLYING CIRCUITS;

EID: 0036161060     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.980019     Document Type: Article

References (10)

1. m)
2. A modified Massey-Omura parallel multiplier for a class of finite fields
3. m)
4. Storage-efficient finite field basis conversion
5. Low-complexity bit-parallel canonical and normal basis multiplier for a class of finite fields
6. Non-conventional basis of finite field
7. m)