Abstract
We focus on the GPS identification scheme implementation in low cost chips, i.e not equipped with a microprocessor (such as those embedded in some prepaid telephone cards or RFID tags). We present three solutions to decrease the overall number of manipulated bits during the computation of the answer by a factor two or three. All the solutions stand in the use of low Hamming weight parameters. The first one consists in building the private key as the product of low Hamming weight sub-keys. The second one suggests the choice of full size low Hamming weight private keys. Finally, the third solution corresponds to a variant of the basic GPS scheme in which large challenges with low Hamming weight are used. Whereas the first solution does not withdraw the need for a multiplier in the chip, the two other ones are ideally suited to low cost chips as they can be implemented with only one serial addition. Therefore, as a surprising result, one entity can be public key authenticated by doing one on-line addition only at the time of authentication!
Chapter PDF
Similar content being viewed by others
References
Cohen, H.: A Course in Computational Algebraic Number Theory, vol. 138. Springer, Heidelberg (1993)
de Rooij, P.: On Schnorr’s Preprocessing for Digital Signature Schemes. Journal of Cryptology 10(1), 1–16 (1997)
Girault, M.: Self-certified public keys. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 490–497. Springer, Heidelberg (1991)
Girault, M., Poupard, Stern, J.: Some modes of use of the GPS identification scheme. In: 3rd Nessie Conference, November 2002, Springer, Heidelberg (2002)
Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. In: 19th Annual ACM Symposium on the Theory of Computing, pp. 210–217 (1987)
Guillou, L.C., Quisquater, J.J.: A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 123–128. Springer, Heidelberg (1988)
Hoffstein, J., Silverman, J.H.: Random Small Hamming Weight Products with Applications to Cryptography. Technical report, NTRU Cryptosystems
Okamoto, T., Tada, M., Miyaji, A.: An Improved Fast Signature Scheme without on-line Multiplication. In: Financial Crypto 2002 (2002)
Pollard, J.M.: Monte Carlo methods for index computations modulo p. Mathematics of Computation 32, 918–924 (1978)
Poupard, G., Stern, J.: Security analysis of a practical “On the fly” authentication and signature generation. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 422–436. Springer, Heidelberg (1998)
Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1990)
Stern, J., Stern, J.P.: Cryptanalysis of the OTM signature scheme from FC’02. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 138–148. Springer, Heidelberg (2003)
Stinson, D.R.: Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem. Mathematics of Computation 71, 379–391 (2002)
Okamoto, T., Katsuno, H., Okamoto, E.: A Fast Signature Scheme based on new on-line Computation. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol. 2851, pp. 111–121. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girault, M., Lefranc, D. (2004). Public Key Authentication with One (Online) Single Addition. In: Joye, M., Quisquater, JJ. (eds) Cryptographic Hardware and Embedded Systems - CHES 2004. CHES 2004. Lecture Notes in Computer Science, vol 3156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28632-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-28632-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22666-6
Online ISBN: 978-3-540-28632-5
eBook Packages: Springer Book Archive