On the public citation graph
The generation of random numbers that are probably prime
0 signed · 63 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/3-540-39799-xopenalex-snapshot
Advances in Cryptology — CRYPTO ’85 Proceedings
inferredcites →https://doi.org/10.1007/3-540-47721-7_32openalex-snapshot
Two Observations on Probabilistic Primality Testing
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
inferredcites →https://doi.org/10.1016/0304-3975(80)90007-9openalex-snapshot
Evaluation and comparison of two efficient probabilistic primality testing algorithms
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/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1038/scientificamerican1282-136openalex-snapshot
The Search for Prime Numbers
inferredcites →https://doi.org/10.1090/s0025-5718-1980-0572872-7openalex-snapshot
The pseudoprimes to 25⋅10⁹
inferredcites →https://doi.org/10.1090/s0025-5718-1986-0815848-xopenalex-snapshot
On the number of false witnesses for a composite number
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866102-2openalex-snapshot
Implementation of a New Primality Test
inferredcites →https://doi.org/10.1137/0204018openalex-snapshot
Every Prime Has a Succinct Certificate
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/1012065openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms (Donald E. Knuth)
inferredcites →https://doi.org/10.1145/12130.12162openalex-snapshot
Almost all primes can be quickly certified
inferredcites →https://doi.org/10.1145/28395.28445openalex-snapshot
Recognizing primes in random polynomial time
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.2307/2006975openalex-snapshot
On Distinguishing Prime Numbers from Composite Numbers
inferredcites →https://doi.org/10.2307/2008231openalex-snapshot
On the Number of False Witnesses for a Composite Number
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
inferredcites →https://doi.org/10.5860/choice.26-3310openalex-snapshot
Algorithmics: theory and practice
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781394351930.ch7openalex-snapshot
Prime Number Generation and RSA Keys
inferred← citeshttps://doi.org/10.1006/jagm.1997.0873openalex-snapshot
A Reliable Randomized Algorithm for the Closest-Pair Problem
inferred← citeshttps://doi.org/10.1006/jagm.2000.1114openalex-snapshot
On Assessing the Performance of Randomized Algorithms
inferred← citeshttps://doi.org/10.1006/jnth.1998.2247openalex-snapshot
A Probable Prime Test with High Confidence
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_45openalex-snapshot
Finding Four Million Large Random Primes
inferred← citeshttps://doi.org/10.1007/3-540-46877-3_10openalex-snapshot
Distributed Primality Proving and the Primality of (23539 + 1)/3
inferred← citeshttps://doi.org/10.1007/3-540-46885-4_59openalex-snapshot
Atkin’s Test: News from the Front
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_6openalex-snapshot
Primality Tests and Use of Primes in Public Key Systems
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_37openalex-snapshot
Speeding up prime number generation
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_36openalex-snapshot
On the difficulty of finding reliable witnesses
inferred← citeshttps://doi.org/10.1007/978-3-030-33649-3_11openalex-snapshot
Intrusion Detection and Network-Based Attacks
inferred← citeshttps://doi.org/10.1007/978-3-030-83411-1_11openalex-snapshot
Intrusion Detection and Network-Based Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-31957-3_80openalex-snapshot
A Practical and Secure Communication Protocol in the Bounded Storage Model
inferred← citeshttps://doi.org/10.1007/bf00190758openalex-snapshot
Short RSA keys and their generation
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/bf02366625openalex-snapshot
Prime-number algorithm for public-key systems
inferred← citeshttps://doi.org/10.1007/bfb0030409openalex-snapshot
The least witness of a composite number
inferred← citeshttps://doi.org/10.1090/mcom/3314openalex-snapshot
Improved error bounds for the Fermat primality test on random inputs
inferred← citeshttps://doi.org/10.1090/s0025-5718-1989-0982368-4openalex-snapshot
The Probability that a Random Probable Prime is Composite
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1189518-9openalex-snapshot
Average case error estimates for the strong probable prime test
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1199989-xopenalex-snapshot
Elliptic Curves and Primality Proving
inferred← citeshttps://doi.org/10.1090/s0025-5718-96-00695-3openalex-snapshot
Further investigations with the strong probable prime test
inferred← citeshttps://doi.org/10.1109/icacsis.2015.7415190openalex-snapshot
Enhancing efficiency of enterprise digital rights management
inferred← citeshttps://doi.org/10.1109/wsc.1989.718716openalex-snapshot
About Polynomial-Ttime "Unpredictable" Generators
inferred← citeshttps://doi.org/10.1145/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
inferred← citeshttps://doi.org/10.1145/3011784.3011799openalex-snapshot
A collection of patterns for prime generation
inferred← citeshttps://doi.org/10.1145/325694.325729openalex-snapshot
Verifying secrets and relative secrecy
inferred← citeshttps://doi.org/10.1145/76738.76799openalex-snapshot
About polynomial-time “unpredictable” generators
inferred← citeshttps://doi.org/10.48550/arxiv.1408.1888openalex-snapshot
On a Deterministic Property of the Category of $k$-almost Primes: A Deterministic Structure Based on a Linear Function for Redefining the $k$-almost Primes ($\exists n\in {\rm N} $, $1{\le} k {\le}n$) in Certain Intervals
inferred← citeshttps://doi.org/10.5121/ijit.2015.4103openalex-snapshot
Advanced Compression Technique for Random Data
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
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.