On the public citation graph

Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time

0 signed · 57 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/11681878_8openalex-snapshot
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
inferredcites →https://doi.org/10.1007/11787006_13openalex-snapshot
Generalized Compact Knapsacks Are Collision Resistant
inferredcites →https://doi.org/10.1007/3-540-48523-6_1openalex-snapshot
Generating Hard Instances of the Short Basis Problem
inferredcites →https://doi.org/10.1007/978-1-4612-1934-7openalex-snapshot
Introduction to Cyclotomic Fields
inferredcites →https://doi.org/10.1007/978-3-030-17656-3_24openalex-snapshot
Approx-SVP in Ideal Lattices with Pre-processing
inferredcites →https://doi.org/10.1007/978-3-030-26948-7_12openalex-snapshot
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm
inferredcites →https://doi.org/10.1007/978-3-030-34621-8_3openalex-snapshot
An LLL Algorithm for Module Lattices
inferredcites →https://doi.org/10.1007/978-3-030-45724-2_12openalex-snapshot
On the Quantum Complexity of the Continuous Hidden Subgroup Problem
inferredcites →https://doi.org/10.1007/978-3-319-56620-7_2openalex-snapshot
Short Generators Without Quantum Computers: The Case of Multiquadratics
inferredcites →https://doi.org/10.1007/978-3-319-56620-7_3openalex-snapshot
Computing Generator in Cyclotomic Integer Rings
inferredcites →https://doi.org/10.1007/978-3-319-72565-9openalex-snapshot
Selected Areas in Cryptography – SAC 2017
inferredcites →https://doi.org/10.1007/978-3-642-10366-7_36openalex-snapshot
Efficient Public Key Encryption Based on Ideal Lattices
inferredcites →https://doi.org/10.1007/978-3-642-38348-9_1openalex-snapshot
Candidate Multilinear Maps from Ideal Lattices
inferredcites →https://doi.org/10.1007/978-3-642-55220-5openalex-snapshot
Advances in cryptology - EUROCRYPT 2014 : 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques Copenhagen, Denmark, May 11-15, 2014 : proceedings
inferredcites →https://doi.org/10.1007/978-3-642-55220-5_14openalex-snapshot
GGHLite: More Efficient Multilinear Maps from Ideal Lattices
inferredcites →https://doi.org/10.1007/978-3-662-49896-5_20openalex-snapshot
Recovering Short Generators of Principal Ideals in Cyclotomic Rings
inferredcites →https://doi.org/10.1007/bf01393839openalex-snapshot
Analytic formulas for the regulator of a number field
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1007/s00037-007-0234-9openalex-snapshot
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
inferredcites →https://doi.org/10.1016/0022-314x(92)90003-8openalex-snapshot
On bases of the Stickelberger ideal and of the group of circular units of a cyclotomic field
inferredcites →https://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
inferredcites →https://doi.org/10.1016/j.jnt.2008.11.006openalex-snapshot
Expander graphs based on GRH with an application to elliptic curve cryptography
inferredcites →https://doi.org/10.1090/fic/041openalex-snapshot
High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams
inferredcites →https://doi.org/10.1090/s0025-5718-02-01432-1openalex-snapshot
Class numbers of real cyclotomic fields of prime conductor
inferredcites →https://doi.org/10.1090/s0025-5718-1990-1023756-8openalex-snapshot
Explicit Bounds for Primality Testing and Related Problems
inferredcites →https://doi.org/10.1090/s0025-5718-2015-02924-xopenalex-snapshot
Real cyclotomic fields of prime conductor and their class numbers
inferredcites →https://doi.org/10.1090/s0025-5718-98-00939-9openalex-snapshot
Minus class groups of the fields of the 𝑙-th roots of unity
inferredcites →https://doi.org/10.1112/s1461157014000345openalex-snapshot
Subexponential class group and unit group computation in large degree number fields
inferredcites →https://doi.org/10.1137/1.9781611973075.40openalex-snapshot
Algorithms for ray class groups and Hilbert class fields
inferredcites →https://doi.org/10.1137/1.9781611974331.ch64openalex-snapshot
Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1145/1568318.1568324openalex-snapshot
On lattices, learning with errors, random linear codes, and cryptography
inferredcites →https://doi.org/10.1145/2535925openalex-snapshot
On Ideal Lattices and Learning with Errors over Rings
inferredcites →https://doi.org/10.1145/2591796.2591860openalex-snapshot
A quantum algorithm for computing the unit group of an arbitrary degree number field
inferredcites →https://doi.org/10.1145/3055399.3055489openalex-snapshot
Pseudorandomness of ring-LWE for any ring and modulus
inferredcites →https://doi.org/10.2307/1970932openalex-snapshot
On the Stickelberger Ideal and the Circular Units of a Cyclotomic Field

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_1openalex-snapshot
On the Hardness of the NTRU Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_17openalex-snapshot
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-22969-5_23openalex-snapshot
Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP.
inferred← citeshttps://doi.org/10.1007/978-3-031-22969-5_24openalex-snapshot
On Module Unique-SVP and NTRU
inferred← citeshttps://doi.org/10.1007/978-3-031-37679-5_10openalex-snapshot
The Special Case of Cyclotomic Fields in Quantum Algorithms for Unit Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-44469-2_10openalex-snapshot
On the Discrete Logarithm Problem in the Ideal Class Group of Multiquadratic Fields
inferred← citeshttps://doi.org/10.1007/978-3-031-80308-6_4openalex-snapshot
On Approx-SVP in Multiquadratic Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-87541-0_7openalex-snapshot
$$\text {Scloud}^+$$: An Efficient LWE-Based KEM Without Ring/Module Structure
inferred← citeshttps://doi.org/10.1007/978-3-031-97260-7_11openalex-snapshot
FPTRU: Optimization of NTRU-Prime and TLS Performance Assessment
inferred← citeshttps://doi.org/10.1007/s10623-025-01601-3openalex-snapshot
Fast multiplication and the PLWE–RLWE equivalence for an infinite family of maximal real subfields of cyclotomic fields
inferred← citeshttps://doi.org/10.1007/s13389-023-00309-1openalex-snapshot
Fast verification and public key storage optimization for unstructured lattice-based signatures
inferred← citeshttps://doi.org/10.1090/mcom/3863openalex-snapshot
A short basis of the Stickelberger ideal of a cyclotomic field
inferred← citeshttps://doi.org/10.1093/comjnl/bxad013openalex-snapshot
Overfull: Too Large Aggregate Signatures Based on Lattices
inferred← citeshttps://doi.org/10.1109/csp62567.2024.00022openalex-snapshot
Finding Generators of Ideals in Non-Cyclic Number Fields by Using Norm Relations
inferred← citeshttps://doi.org/10.1145/3618260.3649766openalex-snapshot
Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs
inferred← citeshttps://doi.org/10.3934/amc.2022082openalex-snapshot
Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction
inferred← citeshttps://doi.org/10.4018/ijisp.386964openalex-snapshot
Leveled Homomorphic Encryption Based on NTRU Without Re-Linearization
inferred← citeshttps://doi.org/10.62056/ab0lmpgxqopenalex-snapshot
Diagonally dominant matrices for cryptography
inferred← citeshttps://doi.org/10.70675/722066c9z764az411ezaba8zecd21695a91fopenalex-snapshot
Exploring the multi-dimensional approach in code-based 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.