• DocumentCode
    1986164
  • Title

    RSA encryption using extended modular arithmetic on the Quicksilver COSM adaptive computing machine

  • Author

    Puttegowda, Kiran ; Athanas, Peter

  • Author_Institution
    Configurable Comput. Lab., Virginia Tech., Blacksburg, VA, USA
  • fYear
    2003
  • fDate
    9-11 April 2003
  • Firstpage
    305
  • Lastpage
    307
  • Abstract
    Modular arithmetic is typically the computational bottleneck in a hardware implementation of public key cryptography algorithms. This paper focuses on an implementation of modular multiplication on the Quicksilver COSM adaptive computing machine as a run-time-reconfigurable user authentication context candidate. The design is targeted specifically to the COSM adaptive computing machine, taking into account the underlying architecture of the device.
  • Keywords
    authorisation; circuit complexity; public key cryptography; reconfigurable architectures; COSM architecture; Quicksilver COSM adaptive computing machine; RSA encryption; context candidate; device architecture; extended modular arithmetic; modular multiplication; public key cryptography algorithm; run-time reconfiguration; user authentication; Arithmetic; Authentication; Cellular phones; Computer architecture; Multiaccess communication; Peer to peer computing; Prototypes; Public key cryptography; Robustness; Runtime;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Field-Programmable Custom Computing Machines, 2003. FCCM 2003. 11th Annual IEEE Symposium on
  • Print_ISBN
    0-7695-1979-2
  • Type

    conf

  • DOI
    10.1109/FPGA.2003.1227282
  • Filename
    1227282