On the public citation graph
Short RSA keys and their generation
0 signed · 71 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-38424-3_40openalex-snapshot
A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms
inferredcites →https://doi.org/10.1007/3-540-39805-8_3openalex-snapshot
Efficient Factoring Based on Partial Information
inferredcites →https://doi.org/10.1007/3-540-47555-9_14openalex-snapshot
Public-Key Cryptosystems with Very Small Key Lengths
inferredcites →https://doi.org/10.1007/978-1-4612-4544-5openalex-snapshot
Factorization and Primality Testing
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1007/bf00202269openalex-snapshot
Fast generation of prime numbers and secure public-key cryptographic parameters
inferredcites →https://doi.org/10.1007/bf00203817openalex-snapshot
Elliptic curve cryptosystems and their implementation
inferredcites →https://doi.org/10.1007/bf00206325openalex-snapshot
The generation of random numbers that are probably prime
inferredcites →https://doi.org/10.1007/bf01578872openalex-snapshot
Contemporary cryptology—The science of information integrity
inferredcites →https://doi.org/10.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
inferredcites →https://doi.org/10.1016/0022-314x(83)90002-1openalex-snapshot
On a problem of Oppenheim concerning “factorisatio numerorum”
inferredcites →https://doi.org/10.1016/0304-3975(76)90050-5openalex-snapshot
Analysis of a simple factorization algorithm
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/00029890.1912.11997658openalex-snapshot
On Composite Numbers P Which Satisfy The Fermat Congruence aP-1≡1 Mod P
inferredcites →https://doi.org/10.1109/49.223883openalex-snapshot
An implementation of elliptic curve cryptosystems over F/sub 2/155
inferredcites →https://doi.org/10.1109/jsac.2019.2959419openalex-snapshot
IEEE Journal on Selected Areas in Communications
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
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/1971363openalex-snapshot
Factoring Integers with Elliptic Curves
inferredcites →https://doi.org/10.3406/marb.1895.2417openalex-snapshot
Recherches arithmétiques sur la composition des formes binaires quadratiques
inferredcites →https://doi.org/10.4169/000298910x484726openalex-snapshot
American Mathematical Monthly
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_1openalex-snapshot
Generating RSA Moduli with a Predetermined Portion
inferred← citeshttps://doi.org/10.1007/3-540-68339-9_16openalex-snapshot
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_10openalex-snapshot
Algorithms for Generating, Testing and Proving Primes: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-27998-5_1openalex-snapshot
Identity-Embedding Method for Decentralized Public-Key Infrastructure
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_13openalex-snapshot
On the Design of RSA with Short Secret Exponent
inferred← citeshttps://doi.org/10.1007/978-3-540-79104-1_9openalex-snapshot
RSA Moduli with a Predetermined Portion: Techniques and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_1openalex-snapshot
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_10openalex-snapshot
Using LLL-Reduction for Solving RSA and Factorization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_5openalex-snapshot
Implicit Factoring with Shared Most Significant and Middle Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-16825-3_3openalex-snapshot
Publishing Upper Half of RSA Decryption Exponent
inferred← citeshttps://doi.org/10.1007/978-3-642-34601-9_29openalex-snapshot
On the Improvement of Fermat Factorization
inferred← citeshttps://doi.org/10.1007/978-3-662-49301-4_10openalex-snapshot
Double-Speed Barrett Moduli
inferred← citeshttps://doi.org/10.1007/s001459900030openalex-snapshot
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
inferred← citeshttps://doi.org/10.1007/s10207-003-0030-8openalex-snapshot
Generating visible RSA public keys for PKI
inferred← citeshttps://doi.org/10.1007/s10623-005-3137-2openalex-snapshot
On RSA Moduli with Prescribed Bit Patterns
inferred← citeshttps://doi.org/10.1007/s10623-015-0067-5openalex-snapshot
Finding shortest lattice vectors faster using quantum search
inferred← citeshttps://doi.org/10.1007/s10623-015-0106-2openalex-snapshot
Guest Editorial: Special Issue in Honor of Scott A. Vanstone
inferred← citeshttps://doi.org/10.1016/j.cose.2009.12.001openalex-snapshot
A security privacy aware architecture and protocol for a single smart card used for multiple services
inferred← citeshttps://doi.org/10.1016/j.dam.2007.12.012openalex-snapshot
On RSA moduli with almost half of the bits prescribed
inferred← citeshttps://doi.org/10.1016/j.future.2013.06.008openalex-snapshot
On the improvement of Fermat factorization using a continued fraction technique
inferred← citeshttps://doi.org/10.1016/j.jisa.2018.12.006openalex-snapshot
RSA public keys with inside structure: Proofs of key generation and identities for web-of-trust
inferred← citeshttps://doi.org/10.1016/j.jnt.2012.07.008openalex-snapshot
On RSA moduli with half of the bits prescribed
inferred← citeshttps://doi.org/10.1023/a:1019199132298openalex-snapshot
A distributed key generation technique for public key infrastructures
inferred← citeshttps://doi.org/10.1109/18.605586openalex-snapshot
Elliptic curve cryptosystems using curves of smooth order over the ring Z/sub n/
inferred← citeshttps://doi.org/10.1109/imis.2012.123openalex-snapshot
A Method for Embedding Secret Key Information in RSA Public Key and Its Application
inferred← citeshttps://doi.org/10.1109/itime.2009.5236369openalex-snapshot
Factoring RSA modulo N with high bits of p known revisited
inferred← citeshttps://doi.org/10.1109/tit.2007.901248openalex-snapshot
Dual RSA and Its Security Analysis
inferred← citeshttps://doi.org/10.1109/wecwis.1999.788201openalex-snapshot
Towards a scalable PKI for electronic commerce systems
inferred← citeshttps://doi.org/10.1145/2484389.2484396openalex-snapshot
Upper bound of the length of information embedd in RSA public key efficiently
inferred← citeshttps://doi.org/10.1155/2014/650537openalex-snapshot
On the Improvement of Wiener Attack on RSA with Small Private Exponent
inferred← citeshttps://doi.org/10.1307/mmj/1100623415openalex-snapshot
Smooth values of shifted primes in arithmetic progressions
inferred← citeshttps://doi.org/10.21123/bsj.8.2.408-418openalex-snapshot
Applying Quran Security and Hamming CodesFor Preventing of Text Modification
inferred← citeshttps://doi.org/10.29042/2018-3922-3926openalex-snapshot
Enhanced RSA Key Generation Modelling Using Fingerprint Biometric
inferred← citeshttps://doi.org/10.4156/jdcta.vol4.issue7.10openalex-snapshot
The Larger Integer Library and the Diffie-Hellman Protocol based on XTR
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/a4c4e8d2z5e4cz4eafzbf6bzfb9b77e3cfb7openalex-snapshot
Authentication and encryption protocols : design, attacks and algorithmic improvements
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.