High Speed RSA Implementation Based on Modified Booth's Technique and Montgomery's Multiplication for FPGA Platform

@article{Ghoreishi2009HighSR,
  title={High Speed RSA Implementation Based on Modified Booth's Technique and Montgomery's Multiplication for FPGA Platform},
  author={S. S. Ghoreishi and M. A. Pourmina and H. Bozorgi and M. Dousti},
  journal={2009 Second International Conference on Advances in Circuits, Electronics and Micro-electronics},
  year={2009},
  pages={86-93}
}
  • S.S. Ghoreishi, M.A. Pourmina, +1 author M. Dousti
  • Published 2009
  • Computer Science
  • 2009 Second International Conference on Advances in Circuits, Electronics and Micro-electronics
  • Rivest, Shamir and Adleman (RSA) encryption algorithm is one of the most widely used and popular public- key cryptosystem. The main step in this algorithm is modular exponentiation which can be done by a sequence of modular multiplication. Thus, modular multiplication is the major factor, in many cryptosystems, e.g. the RSA Two-Key system and in the proposed digital signature standard DSS. One of the most efficient algorithms of modular multiplication is the Montgomery multiplication. In this… CONTINUE READING
    22 Citations
    High radix implementation of Montgomery multipliers with CSA
    • 22
    • PDF
    Software/Hardware Co-Design of Modular Exponentiation for Efficient RSA Cryptosystem
    • 9
    • PDF
    Reconfigurable Architecture to Speed-up Modular Exponentiation
    • 4
    Energy-Efficient High-Throughput Montgomery Modular Multipliers for RSA Cryptosystems
    • 61
    Architecture Optimizations for the RSA Public Key Cryptosystem: A Tutorial
    • 22
    Maximizing the Efficiency using Montgomery Multipliers on FPGA in RSA Cryptography for Wireless Sensor Networks
    • Shaila Leelavathi G
    • 2017
    • PDF
    A parameterized design of Modular Exponentiation on reconfigurable platforms for RSA cryptographic processor
    • 2
    • Highly Influenced
    Architectural Analysis of RSA Cryptosystem on FPGA
    • 11
    Key generation research of RSA public cryptosystem and Matlab implement
    • 8

    References

    SHOWING 1-10 OF 13 REFERENCES
    Cellular-array modular multiplier for fast RSA public-key cryptosystem based on modified Booth's algorithm
    • 47
    Carry-save Montgomery modular exponentiation on reconfigurable hardware
    • 44
    • PDF
    Fast Montgomery modular multiplication and RSA cryptographic processor architectures
    • 128
    • PDF
    High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware
    • 194
    • PDF
    Montgomery modular exponentiation on reconfigurable hardware
    • T. Blum
    • Computer Science
    • Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336)
    • 1999
    • 201
    • PDF
    High-radix modular multiplication for cryptosystems
    • Peter Kornerup
    • Mathematics, Computer Science
    • Proceedings of IEEE 11th Symposium on Computer Arithmetic
    • 1993
    • 70
    • Highly Influential
    • PDF
    Fast algorithm for modular reduction
    • 36
    • PDF
    Analyzing and comparing Montgomery multiplication algorithms
    • 566
    • PDF
    Montgomery exponentiation needs no final subtractions
    • 269
    • PDF
    Method to reduce the sign bit extension in a multiplier that uses the modified Booth algorithm
    • 22