Reconfigurable Architecture for Cryptography over Binary Finite Fields

[1]  P. L. Montgomery.  Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[2]  Philip Heng Wai Leong,et al.  A microcoded elliptic curve processor using FPGA technology , 2002, IEEE Trans. Very Large Scale Integr. Syst..

[3]  R. Dong,et al.  A generator for unique quantum random numbers based on vacuum states , 2010 .

[4]  Don Coppersmith,et al.  The Data Encryption Standard (DES) and its strength against attacks , 1994, IBM J. Res. Dev..

[5]  Mohammed Benaissa,et al.  Fast Elliptic Curve Cryptography on FPGA , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[6]  Andreas Curiger,et al.  On Computing Multiplicative Inverses in GF(2^m) , 1993, IEEE Trans. Computers.

[7]  Francisco Rodríguez-Henríquez,et al.  A parallel architecture for fast computation of elliptic curve scalar multiplication over GF(2/sup m/) , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[8]  Vincent Rijmen,et al.  The Block Cipher Rijndael , 1998, CARDIS.

[9]  Alfred Menezes,et al.  The State of Elliptic Curve Cryptography , 2000, Des. Codes Cryptogr..

[10]  Jürgen Teich,et al.  Reconfigurable implementation of elliptic curve crypto algorithms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[11]  T. Itoh,et al.  A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..

[12]  Berk Sunar,et al.  An Efficient Optimal Normal Basis Type II Multiplier , 2001, IEEE Trans. Computers.

[13]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[14]  Tim Good,et al.  AES on FPGA from the Fastest to the Smallest , 2005, CHES.

[15]  R. Tausworthe.  Random Numbers Generated by Linear Recurrence Modulo Two , 1965 .

[16]  Sorin A. Huss,et al.  FPGA based hardware acceleration for elliptic curve public key cryptosystems , 2004, J. Syst. Softw..

[17]  Francisco Rodríguez-Henríquez,et al.  A fast parallel implementation of elliptic curve point multiplication over GF(2m) , 2004, Microprocess. Microsystems.

[18]  Ricardo Dahab,et al.  Improved Algorithms for Elliptic Curve Arithmetic in GF(2n) , 1998, Selected Areas in Cryptography.

[19]  Pamela Gorkin,et al.  Fermat’s Little Theorem , 2011 .

[20]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[21]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .