A Smart Card Implementation of the Fiat-Shamir Identification Scheme

  • Hans-Joachim Knobloch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 330)


This paper describes results and experiences gained from the test implementation of an interactive identification scheme. It was intended to exploit the feasibility of an asymmetric crypto protocol for a state-of-the-art smart card environment. For that reason the identification scheme proposed by Fiat and Shamir was implemented between an actual smart card microprocessor and an industry standard personal computer with a smart card interface. The limits of a current smart card processor in terms of volatile and nonvolatile memory capacity and instruction set turned out to be a rather strict limitation for the choice of the algorithm used. The most time consuming task during the protocol is modular multiplication. Due to the processor structure it is performed as separate multiplication and reduction, where reduction is led back to integer multiplication. The current implementation allows the authentication of a 120 byte identification string at a security level of 2−20 within an average time of about 6 seconds. The experiences gained during this implementation led to a set of requirements for a future specialised processor for asymmetric cryptographic protocols that will be needed to increase this performance by some orders of magnitude.

VIII. Bibliography

  1. [1]
    A. Fiat, A. Shamir: How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Roc. of CRYPTO 86, Springer LNCS 263, pp. 186–194, 1987Google Scholar
  2. [2]
    D. Gollmann: Linear Recursions of Cascaded Sequences, Contrib. to General Algebra 3, Proceedings of the Vienna Conference 1984, Hölder-Pichler-Tempsky, 1985Google Scholar
  3. [3]
    ISO: Draft International Standard ISO/DIS 7816-3, Identification cards-Integrated circuit(s) cards with contacts-Part 3: Electronic signals and exchange protocols, 1987Google Scholar
  4. [4]
    D. E. Knuth: The Art of Computer Programming, vol. 2: Seminumerical Algorithms, Addison-Wesley, 2nd ed. 1981Google Scholar
  5. [5]
    S. B. Mohan, B. S. Adiga: Fast Algorithms for Implementing RSA Public Key Cryptosystem, Electronics Letters Vol. 21 No. 15, p. 761, August 1985CrossRefGoogle Scholar
  6. [6]
    H. Riesel: Prime Numbers and Computer Methods for Factorization, Birkhäuser 1985Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Hans-Joachim Knobloch
    • 1
  1. 1.Institut für Algorithmen und Kognitive SystemeUniversität Karlsruhe (TH)Karlsruhe FRGermany

Personalised recommendations