RSA Laboratories - Efficient finite field basis conversion involving dual bases. CHES'99.

Dr. Ari Juels Dr. Alina Oprea Kevin Bowers Dr. Nikos Triandopoulos Dr. Ting-Fang Yen Guoying Luo Prof. Ronald L. Rivest John Brainard Todd S. Leetham RSA Labs is Hiring	Burton S. Kaliski Jr. and Moses Liskov Citation: B.S. Kaliski Jr. and M. Liskov. Efficient finite field basis conversion involving dual bases. In C.K. Koç and C. Paar, editors, Cryptographic Hardware and Embedded Systems, vol. 1717 of Lecture Notes in Computer Science, Springer, 1999, pages 135-143. © Springer-Verlag Presented by Moses Liskov at CHES ‘99, Worcester Polytechnic Institute, Worcester, MA, USA, August 12-13, 1999. Abstract: Conversion of finite field elements from one basis representation to another representation in a storage-efficient manner is crucial if these techniques are to be carried out in hardware for cryptographic applications. We present algorithms for conversion to and from dual of polynomial and dual of normal bases, as well as to convert to a polynomial or normal basis which involve the dual of the basis. This builds on work Kaliski and Yin presented at SAC ’98. Click here for paper Click here for slides Top of Page	Selected Publications and Presentations On the security of RSA encryption in TLS. CRYPTO 2002. On hash function firewalls in signature schemes. CT-RSA 2002. An unknown key-share attack on the MQV key agreement protocol. ACM TISSEC, 2001. Server-assisted generation of a strong secret from a password. WET ICE 2000. Efficient finite field basis conversion involving dual bases. CHES'99. Emerging standards for public-key cryptography. Lectures on Data Security: Modern Cryptology in Theory and Practice, 1999. Storage-efficient finite field basis conversion. SAC'98. Proofs for Two-Server Password Authentication. CT-RSA 2005
		Email to a friend Print

Burton S. Kaliski Jr. and Moses Liskov