Skip to main content
Springer Nature Link
Log in

A generalisation of Brickell's algorithm for fast modular multiplication

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Brickell's algorithm findsA ×BmodC forn-bit integersA, B, C, usingO(n) hardware to achieve anO(n) running time. This paper gives a generalisation of his algorithm, and presents a proof, missing from Brickell's paper, that it works, showing the existence of other similar schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Barrett,Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In Lecture Notes in Computer Science 263, Conf. Proceedings, Crypto 86. Springer, 1987.

  2. G. R. Blakeley,A computer algorithm for calculating the product AB modulo M. IEEE Trans. on Computers, Vol. C 32, no. 5, pp. 497–500, May 1983.

    Google Scholar 

  3. E. F. Brickell,A fast modular multiplication algorithm with applications to two key cryptography. In Advances in Cryptology, Conf. Proceedings, Crypto 82. Plenum Press, 1982.

  4. F. E. Fich and M. Tompa,The parallel complexity of exponentiating polynomials over finite fields. 17th ACM Symp. on the Theory of Computing, 1985.

  5. Harn, Hwang, Lee, and Lu,A programmable VLSI architecture for computing multiplication and polynomial evaluation modulo a positive integer. IEEE J. of Solid-state Circuits, Vol. 23, No. 1, pp. 204–207, Feb. 1988.

    Google Scholar 

  6. M. Kochanski,Developing an RSA chip. In Lecture Notes in Computer Science 218, Conf. Proceedings, Crypto 85. Springer, 1985.

  7. C. Mitchell and A. Selby,Algorithms for software implementations of RSA. Memo No. HPL-BRC-TM-87-043, Hewlett Packard Laboratories, Filton Road, Stoke Gifford, Bristol BS12 6QZ, England, 1988.

  8. M. J. Norris and G. J. Simmons,Algorithms for high-speed modular arithmetic. Congressus Numerantium, Vol. 31, 1981.

  9. G. A. Orton, M. P. Roy, P. A. Scott, L. E. Peppard, and S. E. Tavares,VLSI implementation of public-key encryption algorithms. In Lecture Notes in Computer Science 263. Conf., Proceedings, Crypto 86. Springer, 1987.

  10. P. Riess and J. Shawe-Taylor,The RSA public key cryptosystem. Dept. of Statistics and Computer Science notes, RHNBC, Egham Hill, Egham. Surrey, England TW20 0EX, 1986.

  11. R. Rivest, A. Shamir, and L. Adleman,A method for obtaining digital signatures and public key cryptosystems. Comm. ACM, vol. 21, 1978.

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, Birkbeck College, Malet Street, WC1E 7HX, London, England

    J. K. Gibson

Authors
  1. J. K. Gibson
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gibson, J.K. A generalisation of Brickell's algorithm for fast modular multiplication. BIT 28, 755–763 (1988). https://doi.org/10.1007/BF01954895

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01954895

CR Categories

Keywords