On the public citation graph
Some remarks concerning the M.I.T. public-key cryptosystem
0 signed · 49 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01930859openalex-snapshot
Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. Herlestam
inferredcites →https://doi.org/10.1007/bf01932028openalex-snapshot
Critical remarks on some public-key cryptosystems
inferredcites →https://doi.org/10.1007/bf01933667openalex-snapshot
A monte carlo method for factorization
inferredcites →https://doi.org/10.1007/bf02403921openalex-snapshot
Some problems of ‘Partitio numerorum’; III: On the expression of a number as a sum of primes
inferredcites →https://doi.org/10.1016/s0022-0000(76)80043-8openalex-snapshot
Riemann's hypothesis and tests for primality
inferredcites →https://doi.org/10.1017/s0305004100049252openalex-snapshot
Theorems on factorization and primality testing
inferredcites →https://doi.org/10.1080/0161-117791833219openalex-snapshot
PRELIMINARY COMMENTS ON THE M.I.T. PUBLIC-KEY CRYPTOSYSTEM
inferredcites →https://doi.org/10.1080/0161-117891852785openalex-snapshot
REMARKS ON A PROPOSED CRYPTANALYTIC ATTACK ON THE M.I.T. PUBLIC-KEY CRYPTOSYSTEM
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0371800-5openalex-snapshot
A method of factoring and the factorization of 𝐹₇
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0384673-1openalex-snapshot
New primality criteria and factorizations of 2^{𝑚}±1
inferredcites →https://doi.org/10.1090/s0025-5718-1980-0583523-xopenalex-snapshot
Table errata: “A method of factoring and the factorization of 𝐹₇” [Math. Comp. 29 (1975), 183–205; MR 51 #8017] by M. A. Morrison and J. Brillhart
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/360980.361001openalex-snapshot
A design for a number theory package with an optimized trial division routine
inferredcites →https://doi.org/10.1215/ijm/1255631807openalex-snapshot
Approximate formulas for some functions of prime numbers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_42openalex-snapshot
Uniform complexity and digital signatures
inferred← citeshttps://doi.org/10.1007/3-540-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_60openalex-snapshot
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity
inferred← citeshttps://doi.org/10.1007/978-0-387-34943-5_16openalex-snapshot
Power permutations on prime residue classes
inferred← citeshttps://doi.org/10.1007/978-1-4613-2195-8_3openalex-snapshot
The Natural Numbers and Their Primes
inferred← citeshttps://doi.org/10.1007/978-3-642-70865-7_4openalex-snapshot
Authenticity, Anonymity and Security in Osis
inferred← citeshttps://doi.org/10.1007/978-3-642-76562-9_21openalex-snapshot
Effiziente Software-Implementierung des GMR-Signatursystems
inferred← citeshttps://doi.org/10.1007/978-94-009-2794-0_13openalex-snapshot
Recent Developments in Cryptography
inferred← citeshttps://doi.org/10.1007/978-94-009-5113-6_23openalex-snapshot
Processing Techniques in Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/bf00202269openalex-snapshot
Fast generation of prime numbers and secure public-key cryptographic parameters
inferred← citeshttps://doi.org/10.1007/bf01270400openalex-snapshot
Cryptanalysis of R�dei- and Dickson permutations on arbitrary finite rings
inferred← citeshttps://doi.org/10.1007/bf02366625openalex-snapshot
Prime-number algorithm for public-key systems
inferred← citeshttps://doi.org/10.1007/bfb0052249openalex-snapshot
Fast RSA-type cryptosystems using n-adic expansion
inferred← citeshttps://doi.org/10.1007/bfb0055738openalex-snapshot
Fast RSA-type cryptosystem modulo p k q
inferred← citeshttps://doi.org/10.1016/0167-4048(87)90070-8openalex-snapshot
Implementing the RSA cryptosystem
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90034-7openalex-snapshot
Uniform complexity and digital signatures
inferred← citeshttps://doi.org/10.1016/0898-1221(84)90082-8openalex-snapshot
On the concealability of messages by the williams public-key encryption scheme
inferred← citeshttps://doi.org/10.1023/a:1011219027181openalex-snapshot
How to choose secret parameters for RSA-type cryptosystems over elliptic curves
inferred← citeshttps://doi.org/10.1049/el:19930055openalex-snapshot
Determination of the true value of the Euler totient function in the RSA cryptosystem from a set of possibilities
inferred← citeshttps://doi.org/10.1080/07468342.1987.11973000openalex-snapshot
Cryptology: From Caesar Ciphers to Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1109/5.4443openalex-snapshot
Cryptanalysis: a survey of recent results
inferred← citeshttps://doi.org/10.1109/eee.2004.1287337openalex-snapshot
A privacy-friendly loyalty system for electronic marketplaces
inferred← citeshttps://doi.org/10.1109/tit.1980.1056264openalex-snapshot
A modification of the RSA public-key encryption procedure (Corresp.)
inferred← citeshttps://doi.org/10.1145/3243734.3243800openalex-snapshot
Mitigating Risk while Complying with Data Retention Laws
inferred← citeshttps://doi.org/10.1145/800061.808747openalex-snapshot
How to generate random integers with known factorization
inferred← citeshttps://doi.org/10.1515/jmc-2024-0033openalex-snapshot
On integer sequences in cryptography
inferred← citeshttps://doi.org/10.47749/t/unicamp.1984.47141openalex-snapshot
Alguns aspectos da criptografia computacional
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.