scientific article; zbMATH DE number 1962149

MaRDI QIDQ4418534zbMATH OpenFDO

Authors Guido Bertoni, Jorge Guajardo, Sandeep S. Kumar, Gerardo Orlando, Christof Paar, Thomas Wollinger

Publication date 10 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2612/26120158.htm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Recommendations

• Progress in Cryptology - INDOCRYPT 2003
• AOP arithmetic architectures over GF(2\(^m\))
• An area/performance trade-off analysis of a GF(2ᵐ) multiplier architecture for elliptic curve cryptography
• scientific article; zbMATH DE number 1759299
• A new bit-serial multiplier over GF(pm) using irreducible trinomials

Cited in

(8)

• Highly efficient \(\mathrm{GF}(2^8)\) inversion circuit based on redundant GF arithmetic and its application to AES design
• AOP arithmetic architectures over GF(2\(^m\))
• Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition
• Complexity of computation in finite fields
• Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
• Progress in Cryptology - INDOCRYPT 2003
• A new bit-serial multiplier over GF(pm) using irreducible trinomials
• Efficient hardware implementation of finite fields with applications to cryptography

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418534)