Another way of doing RSA cryptography in hardware

L. Batina, G. Muurling

    Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

    Abstract

    In this paper we describe an efficient and secure hardware implementation of the RSA cryptosystem. Modular exponentiation is based on Montgomery’s method without any modular reduction achieving the optimal bound. The presented systolic array architecture is scalable in severalparameters which makes it possible to implement Compaq’s MultiPrime TM in a very efficient way. According to a developed performance model the influence of different parameters is investigated. This platform is optimised for Multiprime as an example for the RSA cryptosystem. In this work we give details about this scheme, which uses three or more factors of the composite N. Security of this scheme, related to this architecture is also presented.
    Original languageEnglish
    Title of host publicationCryptography and coding : 8th IMA International Conference, Cirencester, UK, December 17 - 19, 2001 ; proceedings
    EditorsB. Honary
    Place of PublicationBerlin
    PublisherSpringer
    Pages364-373
    ISBN (Print)978-3-540-43026-1
    DOIs
    Publication statusPublished - 2001
    Eventconference; IMA international congress -
    Duration: 1 Jan 2001 → …

    Publication series

    NameLecture notes in computer science
    Volume2260

    Conference

    Conferenceconference; IMA international congress
    Period1/01/01 → …
    OtherIMA international congress

    Fingerprint Dive into the research topics of 'Another way of doing RSA cryptography in hardware'. Together they form a unique fingerprint.

    Cite this