Recent results on modular multiplications for smart cards - (Extended abstract)

Dhem, JF;Quisquater, Jean-Jacques
(2000) 3rd International Conference on Smart Card Research and Advanced Applications — Location: LOUVAIN LA NEUVE(Belgium) (14.September.1998)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 240.44 KB
Request a copy

Details

Authors
  • Dhem, JF
    Author
  • Quisquater, Jean-JacquesUCLouvain
    Author
Abstract
In most currently used public-key cryptographic systems, including those based on the difficulty to either factorize large numbers like the RSA [RSA78] or to extract a discrete logarithm of a large number [Elg85,DH76,US 94], the most time consuming part is modular exponentiation. The base of this computation is modular multiplication. We demonstrate the ability to implement very efficiently public-key cryptographic algorithms on nearly standard processors. Furthermore, as our study is also oriented to smart cards, we focus on algorithms minimizing the RAM needed for the computations as well as the ROM code.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Dhem, J., & Quisquater, J.-J. (2000). Recent results on modular multiplications for smart cards - (Extended abstract). Lecture Notes in Computer Science, 1820, 336-352. https://doi.org/10.1007/10721064_31 (Original work published 2000)