17 search results - page 1 / 4 » Redundant Trinomials for Finite Fields of Characteristic 2 |
ACISP
2005
Springer
14 years 10 days ago
2005
Springer
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...
ARC
2007
Springer
14 years 4 months ago
2007
Springer
We present a method for implementing a fast multiplier for finite fields GF(2m ) generated by irreducible trinomials of the form αm + αn
TC
2008
13 years 10 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
FDTC
2006
Springer
14 years 2 months ago
2006
Springer
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
FFA
2010
13 years 9 months ago
2010