On the public citation graph

Fast RSA-type cryptosystems using n-adic expansion

https://doi.org/10.1007/bfb0052249
0 signed · 40 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-46766-1_20openalex-snapshot
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
inferredcites →https://doi.org/10.1007/3-540-48285-7_4openalex-snapshot
A New Elliptic Curve Based Analogue of RSA
inferredcites →https://doi.org/10.1007/3-540-68339-9_1openalex-snapshot
Low-Exponent RSA with Related Messages
inferredcites →https://doi.org/10.1007/3-540-68339-9_14openalex-snapshot
Finding a Small Root of a Univariate Modular Equation
inferredcites →https://doi.org/10.1007/3-540-68339-9_5openalex-snapshot
A Public Key Cryptosystem Based on Elliptic Curves over ℤ/nℤ Equivalent to Factoring
inferredcites →https://doi.org/10.1007/3-540-68339-9_6openalex-snapshot
Public Key Encryption and Signature Schemes Based on Polynomials over ℤn
inferredcites →https://doi.org/10.1007/bf00193566openalex-snapshot
A cubic RSA code equivalent to factorization
inferredcites →https://doi.org/10.1007/bf01931269openalex-snapshot
Some remarks concerning the M.I.T. public-key cryptosystem
inferredcites →https://doi.org/10.1007/bfb0009515openalex-snapshot
The multi-variable modular polynomial and its applications to cryptography
inferredcites →https://doi.org/10.1007/s001459900020openalex-snapshot
A chosen message attack on Demytko’s elliptic curve cryptosystem
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.1090/s0025-5718-98-00944-2openalex-snapshot
Subquadratic-time factoring of polynomials over finite fields
inferredcites →https://doi.org/10.1109/18.54902openalex-snapshot
Cryptanalysis of short RSA secret exponents
inferredcites →https://doi.org/10.1109/sfcs.1982.100openalex-snapshot
Why and how to establish a private code on a public network
inferredcites →https://doi.org/10.1137/0217013openalex-snapshot
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
inferredcites →https://doi.org/10.1137/0217019openalex-snapshot
Solving Simultaneous Modular Equations of Low Degree
inferredcites →https://doi.org/10.1145/225058.225166openalex-snapshot
Subquadratic-time factoring of polynomials over finite fields
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.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography

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-36178-2_19openalex-snapshot
The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/3-540-44495-5_25openalex-snapshot
A Generalized Takagi-Cryptosystem with a Modulus of the Form prqs
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_1openalex-snapshot
New Semantically Secure Public-Key Cryptosystems from the RSA-Primitive
inferred← citeshttps://doi.org/10.1007/978-3-319-29485-8_26openalex-snapshot
Factoring $$N=p^rq^s$$ for Large r and s
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_2openalex-snapshot
Some RSA-Based Encryption Schemes with Tight Security Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_14openalex-snapshot
Efficient Public-Key Cryptosystems Provably Secure Against Active Adversaries
inferred← citeshttps://doi.org/10.1007/bfb0055738openalex-snapshot
Fast RSA-type cryptosystem modulo p k q
inferred← citeshttps://doi.org/10.1007/s10440-006-9045-2openalex-snapshot
A Review on the Isomorphism Classes of Hyperelliptic Curves of Genus 2 over Finite Fields Admitting a Weierstrass Point
inferred← citeshttps://doi.org/10.1007/s11227-010-0546-4openalex-snapshot
User requirements-aware security ranking in SSL protocol
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.114047openalex-snapshot
An alternative practical public-key cryptosystems based on the Dependent RSA Discrete Logarithm Problems
inferred← citeshttps://doi.org/10.1063/1.4968151openalex-snapshot
Analysis on the Rabin-p cryptosystem
inferred← citeshttps://doi.org/10.1109/access.2020.2967396openalex-snapshot
Towards a Novel Generalized Chinese Remainder Algorithm for Extended Rabin Cryptosystem
inferred← citeshttps://doi.org/10.1109/inmic64792.2024.11004308openalex-snapshot
Reconfigurable Cryptoprocessor Design for RSA and Rabin-p Cryptosystems
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358422openalex-snapshot
Optimized security of WAP based on modification of encryption algorithm for PKQ cryptosystem in mobile networks
inferred← citeshttps://doi.org/10.1109/mobhoc.2009.5337048openalex-snapshot
QoS-aware optimization strategy for security ranking in SSL protocol
inferred← citeshttps://doi.org/10.1109/tit.2009.2025532openalex-snapshot
One-Wayness Equivalent to General Factoring
inferred← citeshttps://doi.org/10.1515/jmc-2016-0025openalex-snapshot
Cryptanalysis of an RSA variant with moduli N = p r q l
inferred← citeshttps://doi.org/10.26083/tuprints-00000104openalex-snapshot
New public-key cryptosystems with fast decryption
inferred← citeshttps://doi.org/10.3329/dujs.v70i2.62600openalex-snapshot
A Variant of the RSA Cryptosystem with Smaller Keys
inferred← citeshttps://doi.org/10.3329/ganit.v44i2.78527openalex-snapshot
Variants of RSA and Rabin Cryptosystems modulo p^rq^s
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.