On the public citation graph
A cubic RSA code equivalent to factorization
0 signed · 26 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-x_26openalex-snapshot
An M3 Public-Key Encryption Scheme
inferredcites →https://doi.org/10.1007/978-1-4757-1779-2openalex-snapshot
A Classical Introduction to Modern Number Theory
inferredcites →https://doi.org/10.1016/0898-1221(79)90039-7openalex-snapshot
Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages
inferredcites →https://doi.org/10.1016/0898-1221(84)90082-8openalex-snapshot
On the concealability of messages by the williams public-key encryption scheme
inferredcites →https://doi.org/10.1109/tit.1980.1056264openalex-snapshot
A modification of the RSA public-key encryption procedure (Corresp.)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6440(200008)83:8<19::aid-ecjc3>3.0.co;2-0openalex-snapshot
Construction of RSA cryptosystem over the algebraic field using ideal theory and investigation of its security
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_12openalex-snapshot
On the Security of an RSA Based Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-76620-1_6openalex-snapshot
A Novel RSA-Like Cryptosystem Based on a Generalization of the Rédei Rational Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_28openalex-snapshot
Generalized Powering Functions and Their Application to Digital Signatures
inferred← citeshttps://doi.org/10.1007/bf00197941openalex-snapshot
Proof of soundness (integrity) of cryptographic protocols
inferred← citeshttps://doi.org/10.1007/bf01398010openalex-snapshot
A public-key cryptosystem utilizing cyclotomic fields
inferred← citeshttps://doi.org/10.1007/bfb0028491openalex-snapshot
Trapdoor one-way permutations and multivariate polynomials
inferred← citeshttps://doi.org/10.1007/bfb0052249openalex-snapshot
Fast RSA-type cryptosystems using n-adic expansion
inferred← citeshttps://doi.org/10.1007/bfb0053717openalex-snapshot
The security of public key cryptosystems based on integer factorization
inferred← citeshttps://doi.org/10.1007/bfb0054135openalex-snapshot
A new public-key cryptosystem as secure as factoring
inferred← citeshttps://doi.org/10.1007/s001459900038openalex-snapshot
A Public-Key Cryptosystem Using Purely Cubic Fields
inferred← citeshttps://doi.org/10.1080/00150517.2006.12428314openalex-snapshot
Some remarks on Williams’ public-key crypto functions
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.1.81openalex-snapshot
Generalized Powering Functions and Their Application to Digital Signatures
inferred← citeshttps://doi.org/10.1109/aicera.2012.6306739openalex-snapshot
PCLA: A new public-key cryptosystem based on logarithmic approach
inferred← citeshttps://doi.org/10.1109/csnt.2013.101openalex-snapshot
Designing and Performance Analysis of a Proposed Symmetric Cryptography Algorithm
inferred← citeshttps://doi.org/10.1109/wcse.2009.249openalex-snapshot
Some Properties of Algebraic Structures of RSA-like Systems
inferred← citeshttps://doi.org/10.1145/188280.188298openalex-snapshot
Cryptanalysis and protocol failures
inferred← citeshttps://doi.org/10.20868/upm.thesis.193openalex-snapshot
Números primos especiales y sus aplicaciones criptográficas
inferred← citeshttps://doi.org/10.26083/tuprints-00000104openalex-snapshot
New public-key cryptosystems with fast decryption
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.