Montgomery in practice: how to do it more efficiently in hardware

L. Batina, G. Bruin - Muurling

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

    16 Citations (Scopus)
    10 Downloads (Pure)

    Abstract

    This work describes a fully scalable hardware architecture for modular multiplication which is efficient for an arbitrary bit length. This solution uses a systolic array implementation and can be used for arbitary precision without any modification. This notion of scalability includes both, freedom in choice of operand precision as well as adaptability to any desired gate complexity. We present modular exponentiation based on Montgomery’s method without any modular reduction achieving the best possible bound according to C. Walter. Even more, this tight bound appeared to be practical in our architecture. The described systolic array architecture is unique, being scalable in several parameters and resulting in a class of exponentiation engines. The data provided in the figures and tables are believed to be new, providing a practical dimension of this work.
    Original languageEnglish
    Title of host publicationTopics in cryptology - CT-RSA 2002: the cryptographers' track at RSA conference, 2nd, San Jose, CA., USA, February 18-22 2002
    EditorsB. Preneel
    Place of PublicationBerlin
    PublisherSpringer
    Pages40-52
    ISBN (Print)978-3-540-43224-1
    DOIs
    Publication statusPublished - 2002
    Eventconference; RSA Conference -
    Duration: 1 Jan 2002 → …

    Publication series

    NameLecture Notes in Computer Science
    Volume2271
    ISSN (Print)0302-9743

    Conference

    Conferenceconference; RSA Conference
    Period1/01/02 → …
    OtherRSA Conference

    Fingerprint

    Dive into the research topics of 'Montgomery in practice: how to do it more efficiently in hardware'. Together they form a unique fingerprint.

    Cite this