Perhaps I should be more detailed ;) I'm interested in providing Koblitz curve specific functionality to the elliptic curve portion of OpenSSL--they are currently treated as regular binary curves. All point doublings can be replaced by a simpler operation called the Frobenius map, leading to quite a speed improvement.
I implemented a prototype for this, some details are given in (p5, Tbl 2), signing and verifications see roughly a 50% speedup: http://www.tcs.hut.fi/Publications/bbrumley/pla_implicitcerts_2008.pdf The implementation currently lives outside of OpenSSL, so it should be properly integrated and tightened up; Koblitz curves should then call down to this specific scalar multiplication function, instead of the generic Montgomery's ladder currently used for binary curves. Textbook LD coordinates are also included in the implementation. If there is any interest in this kind of functionality, I'm hoping an OpenSSL developer would be willing to act as a mentor for me to do the work as part of Google summer of code. If so, please feel free to reply here or contact me directly for more detailed discussions. Billy billy.brumley at hut dot fi On Sun, Feb 22, 2009 at 7:51 PM, Billy Brumley <bbrum...@gmail.com> wrote: > Hi--hopefully this is the correct list. Is there any chance of openssl > participating as a mentor organization for Google summer of code? > > Best, > > Billy > ______________________________________________________________________ OpenSSL Project http://www.openssl.org Development Mailing List openssl-dev@openssl.org Automated List Manager majord...@openssl.org
