Efficient FPGA-based multipliers for double-struck F sign397 and double-struck F sign36.97

Proceedings - 2007 International Conference on Field Programmable Logic and Applications, FPL

Volumn , Issue , 2007, Pages 339-344

  Shokrollahi, Jamshid ^a   Gorla, Elisa ^b   Puttmann, Christoph ^c  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF ZURICH   (Switzerland)

^c UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Finite field multiplication; FPGA; Pairing based cryptography

Indexed keywords

FIELD PROGRAMMABLE GATE ARRAYS (FPGA); SHIFT REGISTERS;

FINITE FIELD MULTIPLICATION; FINITE FIELDS; FPGA; NEW STRUCTURES; PAIRING-BASED CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 48149104069     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FPL.2007.4380669     Document Type: Conference Paper

References (14)

1. D. E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 3rd ed. Reading MA: Addison-Wesley, 1998, first edition 1969.
2. J. von zur Gathen and J. Gerhard, Modern Computer Algebra, 2nd ed. Cambridge, UK: Cambridge University Press, 2003, first edition 1999.
3. Digital Signature Standard (DSS), U.S. Department of Commerce / National Institute of Standards and Technology, January 2000, federal Information Processings Standards Publication 186-2. [Online]. Available: http://csrc.nist.gov/publications/fips/fips186-2/fips186-2-change1.pdf
4. D. V. Bailey and C. Paar, "Optimal extension fields for fast arithmetic in public-key algorithms," in Advances in Cryptology: Proceedings of CRYPTO '98, Santa Barbara CA, ser. Lecture Notes in Computer Science, H. Krawczyk, Ed., no. 1462. Springer-Verlag, 1998, pp. 472-485.
5. R. M. Avanzi and P. Mihǎilescu, "Generic efficient arithmetic algorithms for PAFFs (processor adequate finite fields) and related algebraic structures (extended abstract)," in Selected Areas in Cryptography (SAC 2003). Springer-Verlag, 2003, pp. 320-334.
6. I. Duursma and H. Lee, "Tate-pairing implementations for tripartite key agreement." [Online]. Available: citeseer.ist.psu.edu/ duursma03tatepairing.html
7. T. Kerins, W. P. Marnane, E. M. Popovici, and P. S. L. M. Barreto, "Efficient hardware for the tate pairing calculation in characteristic three," in Cryptographic Hardware and Embedded Systems, CHES2005, ser. Lecture Notes in Computer Science, J. R. Rao and B. Sunar, Eds., vol. 3659. Springer-Verlag, 2005, pp. 412-426.
8. m) arithmetic architectures for cryptographic applications," in Topics in cryptology, CTRSA 2003: the Cryptographers' Track at the RSA Conference 2003, San Francisco, CA, USA, April 13-17, 2003: Proceedings, ser. Lecture Notes in Computer Science, M. Joye, Ed., vol. 2612. Springer-Verlag, 2003, pp. 158-175.
9. R. J. McEliece, Finite Fields for Computer Scientists and Engineers. Kluwer Academic Publishers, 1987.
10. J. Shokrollahi, "Efficient implementation of elliptic curve cryptography on FPGAs," Ph.D. dissertation, Bonn University, Bonn, December 2006. [Online]. Available: http://hss.ulb.unibonn.de/diss_online/math_nat_fak/ 2007/shokrollahi_jamshid/index.htm
11. R. Granger, D. Page, and M. Stam, "Hardware and software normal basis arithmetic for pairing-based cryptogaphy in characteristic three," IEEE Transactions on Computers, vol. 54, no. 7, pp. 852-860, 2005.
12. 2 in hardware," in IEEE Information Theory Workshop (2006). Punta del Este, Uruguay: IEEE, March 2006, pp. 107-111.
13. A. Karatsuba and Y. Ofman, "Multiplication of multidigit numbers on automata," Soviet Physics-Doklady, vol. 7, no. 7, pp. 595-596, January 1963,
14. translated from Doklady Akademii Nauk SSSR, Vol. 145, No. 2, pp. 293-294, July,