Project Overview:

Hyperelliptic curves are generalizations of elliptic curves, and have been of recent interest to cryptographic researchers. Currently, very few real-world implementations of HEC cryptosystems exist, so this project aims at creating several implementations in an effort to truely judge their speed and efficiency.

Project work has been done both at the software and hardware levels. We have completed several genus two implementations in hardware, over binary fields. Currently, we are finishing up a genus three software version that takes advantage of the 64-bit Sparc architecture.

Those Involved:

• Nigel Boston
• Charles Clancy
• Negar Kiyavash
• Yihsiang Liow (alumni)
• Jonathan Webster

Fall 2002 Meetings: No formal mettings
Spring 2002 Meetings: 6pm, Tue/Thu work sessions, 342 CSL
Fall 2001 Meetings: 4pm, Tuesdays, 114 CSL

Publications:

• T Clancy, N Kiyavash. "Efficient Genus Three Hyperelliptic Curve Cryptosystems on 64-bit Systems."
  in progress
  
  
• T Clancy. "FPGA-based Hyperelliptic Curve Cryptosystems."
  invited paper at AMS Central Section Meeting, April 2003
  
  
• T Clancy. "Analysis of FPGA-based Hyperelliptic Curve Cryptosystems."
  Master's Thesis, University of Illinois Urbana-Champaign, December 2002
  
  
• N Boston, T Clancy, Y Liow, J Webster. "Genus Two Hyperelliptic Curve Coprocessor."
  Workshop on Cryptographic Hardware and Embedded Systems (CHES), August 2002