On the public citation graph
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
0 signed · 51 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_9openalex-snapshot
On the Computation of Discrete Logarithms in Class Groups
inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/3-540-46885-4_57openalex-snapshot
On the Complexity and Efficiency of a New Key Exchange System
inferredcites →https://doi.org/10.1007/978-3-642-68130-1openalex-snapshot
Introduction to Number Theory
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/bf02351718openalex-snapshot
A key distribution system equivalent to factoring
inferredcites →https://doi.org/10.1007/bf02351719openalex-snapshot
A key-exchange system based on imaginary quadratic fields
inferredcites →https://doi.org/10.1007/bfb0091539openalex-snapshot
Factoring integers with the number field sieve
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1090/s0025-5718-99-01003-0openalex-snapshot
Applying sieving to the computation of quadratic class groups
inferredcites →https://doi.org/10.1090/s0894-0347-1989-1002631-0openalex-snapshot
A Rigorous Subexponential Algorithm For Computation of Class Groups
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/168588.168595openalex-snapshot
A new signature scheme based on the DSA giving message recovery
inferredcites →https://doi.org/10.1201/9780429246593openalex-snapshot
An Introduction to the Bootstrap
inferredcites →https://doi.org/10.22028/d291-25693openalex-snapshot
Ein Algorithmus zur Bestimmung der Klassengruppe positiv definierter binärer quadratischer Formen
inferredcites →https://doi.org/10.22028/d291-25831openalex-snapshot
LiDIA : a library for computational number theory
inferredcites →https://doi.org/10.2307/1971363openalex-snapshot
Factoring Integers with Elliptic Curves
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-44983-3_20openalex-snapshot
Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_1openalex-snapshot
Faster Generation of NICE-Schnorr-Type Signatures
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_16openalex-snapshot
On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC
inferred← citeshttps://doi.org/10.1007/3-540-46513-8_11openalex-snapshot
Efficient Implementation of Cryptosystems Based on Non-maximal Imaginary Quadratic Orders
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_28openalex-snapshot
NICE - New Ideal Coset Encryption -
inferred← citeshttps://doi.org/10.1007/978-3-030-16458-4_20openalex-snapshot
Improved Efficiency of a Linearly Homomorphic Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-031-22966-4_4openalex-snapshot
Threshold Linearly Homomorphic Encryption on $\\mathbf{Z}/2^k\\mathbf{Z}$
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_26openalex-snapshot
Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_30openalex-snapshot
A Survey of Cryptosystems Based on Imaginary Quadratic Orders
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_8openalex-snapshot
NICE — Ein neues Kryptosystem mit schneller Entschlüsselung
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_9openalex-snapshot
Wie sicher ist die Public-Key-Kryptographie?
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_2openalex-snapshot
An Efficient NICE-Schnorr-Type Signature Scheme
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-48000-6_18openalex-snapshot
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_13openalex-snapshot
An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_15openalex-snapshot
On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
inferred← citeshttps://doi.org/10.1007/bfb0055738openalex-snapshot
Fast RSA-type cryptosystem modulo p k q
inferred← citeshttps://doi.org/10.1007/s00145-023-09459-1openalex-snapshot
I Want to Ride My BICYCL : BICYCL Implements CryptographY in CLass Groups
inferred← citeshttps://doi.org/10.1007/s001450010013openalex-snapshot
Computing Discrete Logarithms in Quadratic Orders
inferred← citeshttps://doi.org/10.1007/s001459910010openalex-snapshot
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
inferred← citeshttps://doi.org/10.1023/b:desi.0000012439.20075.16openalex-snapshot
Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders
inferred← citeshttps://doi.org/10.1109/tit.2007.901248openalex-snapshot
Dual RSA and Its Security Analysis
inferred← citeshttps://doi.org/10.1142/9789812799890_0007openalex-snapshot
NUMBER THEORY AND PUBLIC-KEY CRYPTOGRAPHY
inferred← citeshttps://doi.org/10.1145/3460120.3484773openalex-snapshot
Efficient CCA Timed Commitments in Class Groups
inferred← citeshttps://doi.org/10.26083/tuprints-00000104openalex-snapshot
New public-key cryptosystems with fast decryption
inferred← citeshttps://doi.org/10.3934/amc.2010.4.141openalex-snapshot
Improvements in the computation of ideal class groups of imaginary quadratic number fields
inferred← citeshttps://doi.org/10.4213/mvk3openalex-snapshot
Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом
inferred← citeshttps://doi.org/10.70675/90507331z61c5z4378zb146z0dca82ef4571openalex-snapshot
Functional encryption and distributed signatures based on projective hash functions, the benefit of class groups
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.