ESIGN is an efficient digital signature algorithm [OkS], [Ok], whose computation speed is more than twenty times faster than that of the RSA scheme, while its key length and signature length are comparable to those of the RSA scheme. This paper presents a software implementation of ESIGN on an 8bit micro-processor smart card. This realizes a computation time for signature generation of about 0.2 seconds. To achieve this remarkable speed for signature generation, appropriate implementation techniques such as pre-computation and table look-up techniques are effectively used. Moreover, this software implementation is compact enough for smart cards; the program size and the data size including the work area are at most 3Kbytes each. Practical identification schemes based on ESIGN are also presented.

References in zbMATH (referenced in 21 articles , 1 standard article )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Hindry, Marc: Arithmetics. Primality and codes, analytic number theory, Diophantine equations, elliptic curves (2008)
  2. Bohli, Jens-Matthias; Steinwandt, Rainer: On subliminal channels in deterministic signature schemes (2005)
  3. Flament, Dominique: History on complex numbers. Between algebra and geometry (2003)
  4. Fouque, Pierre-Alain; Howgrave-Graham, Nick; Martinet, Gwenaëlle; Poupard, Guillaume: The insecurity of Esign in practical implementations (2003)
  5. Granboulan, Louis: How to repair ESIGN (2003)
  6. Okamoto, Tatsuaki; Stern, Jacques: Almost uniform density of power residues and the provable security of ESIGN (2003)
  7. Stern, Jacques: Why provable security matters? (2003)
  8. Abry, Patrice (ed.); Gonçalves, Paulo (ed.); Lévy Véhel, Jacques (ed.): Scaling, fractals and wavelets. Volume 2. (2002)
  9. Abry, Patrice (ed.); Gonçalves, Paulo (ed.); Lévy Véhel, Jacques (ed.): Scaling, fractals and wavelets. Volume 1. (2002)
  10. Stern, Jacques; Pointcheval, David; Malone-Lee, John; Smart, Nigel P.: Flaws in applying proof methodologies to signature schemes (2002)
  11. el Mahassni, Edwin; Shparlinski, Igor: On some uniformity of distribution properties of ESIGN (2001)
  12. Kim, Hyung Soo; Hero, Alfred O. III.: Comparison of GLR and invariant detectors under structured clutter covariance. (2001)
  13. Peralta, René: Elliptic curve factorization using a “partially oblivious” function (2001)
  14. Yamamoto, Hideo; Kobayashi, Tetsutaro; Morita, Masahiro; Yamada, Ryuji: Public-key-based high-speed payment (electronic money) system using contact-less smart cards (2001)
  15. Azizi, Abdelmalek: On the capitulation of the 2-class group of $\bbfK=\bbfQ(\sqrt2pq, i)$ where $p\equiv -q\equiv 1\mod 4$ (2000)
  16. Bernardi, Christine; Métivet, Brigitte: Error indicators for the heat equation (2000)
  17. Désidéri, Jean-Antoine: Discrete models and iterative schemes. Application to multigrid and multidomain algorithms (1998)
  18. Preneel, Bart: Cryptographic primitives for information authentication -- State of the art (1998)
  19. Paumier, Jean-Claude: Bifurcations and numerical methods. Applications to semilinear elliptic equations (1997)
  20. Champier, S.; Gallouet, T.: Convergence d’un schéma décentré amont sur un maillage triangulaire pour un problème hyperbolique linéaire. (Convergence of an upwind uncentered scheme on a triangular mesh for a nonlinear hyperbolic equation) (1992)

1 2 next