Elsevier

Computers & Security

Volume 3, Issue 1, February 1984, Pages 45-47
Computers & Security

A note on the mathematics of public-key cryptosystems

https://doi.org/10.1016/0167-4048(84)90026-9Get rights and content

Abstract

This note presents several new number-theoretic results with theoretical connections to the area of so-called RSA public-key cryptosystems. Indeed, the results have an independent mathematical interest of their own. No claim is made concerning the practicality of the results for support in breaking RSA cryptosystems.

References (8)

  • W. Diffie et al.

    New directions in cryptography

    IEEE Trans. I.T.

    (Nov., 1976)
  • R.L. Rivest et al.

    A method for obtaining digital signatures and public key Cryptosystems

    Comm. ACM

    (Feb., 1978)
  • M.R. Garey et al.

    Computers and Intractability

    (1979)
  • W.G. Leavitt et al.

    Primes differing by a fixed integer

    Mathematics of Computation

    (Oct., 1981)
There are more references available in the full text version of this article.

Cited by (0)

Colonel Albert A. Mullin, attended Syracuse University (1951–1955), the Massachusetts Institute of Technology (1955–1957), and the University of Illinois (1957–1963) obtaining the BS and SM degrees in Electrical Engineering and a MS degree in Mathematics. While on duty with the U.S.Army, he served in the Livermore National Laboratory (1964–1966), Korea (1966–1967), Vietnam (1970–1971), and the Pentagon (1972–1974). At the Pentagon, he was responsible for the Army-wide Computer and Mathematics Programs. Further, he has had responsibilities for software quality assurance and simulation developments with the Ballistics Missile Defence Organization, Huntsville, AL.

In recent years, he has supported various technical projects at the U.S. Army Missile Intelligence Agency, Redstone Arsenal, Alabama.Colonel Mullin is a member of the American Mathematical Society, the London Mathematical Society, and the Deutche Mathematiker Vereinigung.

View full text