Publication:4418534
From MaRDI portal
zbMath1039.68508MaRDI QIDQ4418534
Guido Bertoni, Christof Paar, Thomas Wollinger, Sandeep S. Kumar, Gerardo Orlando, Jorge Guajardo
Publication date: 10 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2612/26120158.htm
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)
Related Items
Efficient hardware implementation of finite fields with applications to cryptography, A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials, Complexity of computation in finite fields, Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition