Recovering Short Generators of Principal Ideals in Cyclotomic Rings

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2016-05-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-662-49896-5_20
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Introduction To Cyclotomic Fields

  2016cited by this paper
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields

  2016cited by this paper
• An explicit lower bound on moduli of Dirichlet L-functions at s = 1

  2015cited by this paper
• Solving the Closest Vector Problem in $2^n$ Time - The Discrete Gaussian Strikes Again!

  2015cited by this paper
• Real cyclotomic fields of prime conductor and their class numbers

  2014cited by this paper
• GGHLite: More Efficient Multilinear Maps from Ideal Lattices

  2014cited by this paper
• Subexponential class group and unit group computation in large degree number fields

  2014influential reference
• SOLILOQUY: A CAUTIONARY TALE

  2014influential reference
• Class numbers of totally real fields and applications to the Weber class number problem

  2014cited by this paper
• A quantum algorithm for computing the unit group of an arbitrary degree number field

  2014cited by this paper
• Subexponential time relations in the class group of large degree number fields

  2014cited by this paper
• A Toolkit for Ring-LWE Cryptography

  2013cited by this paper
• Candidate Multilinear Maps from Ideal Lattices

  2013cited by this paper
• Conditional bounds for the least quadratic non-residue and related problems

  2013cited by this paper
• Analysis of Boolean Functions

  2012cited by this paper
• Introduction to the non-asymptotic analysis of random matrices

  2010cited by this paper
• An Efficient and Parallel Gaussian Sampler for Lattices

  2010influential reference
• On Ideal Lattices and Learning with Errors over Rings

  2010cited by this paper
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

  2010cited by this paper
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

  2010cited by this paper
• Fully homomorphic encryption using ideal lattices

  2009cited by this paper
• SWIFFT: A Modest Proposal for FFT Hashing

  2008cited by this paper
• Lattices that admit logarithmic worst-case to average-case connection factors

  2007influential reference
• Worst-case to average-case reductions based on Gaussian measures

  2004cited by this paper
• Class numbers of real cyclotomic fields of prime conductor

  2003cited by this paper
• Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

  2002cited by this paper
• Cryptanalysis of the Revised NTRU Signature Scheme

  2002cited by this paper
• NTRU: A Ring-Based Public Key Cryptosystem

  1998cited by this paper
• Balancing vectors and Gaussian measures of n-dimensional convex bodies

  1998cited by this paper
• Lattice coverings and Gaussian measures of n-dimensional convex bodies

  1995influential reference
• New bounds in some transference theorems in the geometry of numbers

  1993cited by this paper
• A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms

  1987cited by this paper
• On Lovász’ lattice reduction and the nearest lattice point problem

  1986cited by this paper
• INTRODUCTION TO CYCLOTOMIC FIELDS(Graduate Texts in Mathematics, 83)

  1983cited by this paper
• Factoring polynomials with rational coeficients

  1982cited by this paper
• Factoring polynomials with rational coefficients

  1982cited by this paper
• Lattices and Factorization of Polynomials over Algebraic Number Fields

  1982cited by this paper
• Algebraic theory of numbers

  1971influential reference
• Multiplicative Number Theory

  1967influential reference
• Journal für die reine und angewandte Mathematik

  year unknowncited by this paper
• Über Dirichletsche Reihen mit komplexen Charakteren.

  year unknowncited by this paper
• Journal of Graph Algorithms and Applications Many-to-one Boundary Labeling

  year unknowncited by this paper
• Journal für die reine und angewandte Mathematik

  year unknowncited by this paper
• Heuristics for class numbers of prime-power real cyclotomic fields

  year unknowncited by this paper

• Simultaneous Approximation for Lattice-Based Cryptography

  2026cites this paper
• Principal ideal problem and ideal shortest vector over rational primes in power-of-two cyclotomic fields

  2026cites this paper
• An improved upper bound on the covering radius of the logarithmic lattice of Q ( ζ n )

  2025cites this paper
• Solving the Decision Principal Ideal Problem with Pre-processing

  2025cites this paper
• Diagonally dominant matrices for cryptography

  2025cites this paper
• Predicting Module-Lattice Reduction

  2025influential citation
• Security Guidelines for Implementing Homomorphic Encryption

  2025cites this paper
• Efficient Methods for Simultaneous Homomorphic Inversion

  2025cites this paper
• For what algebraic systems does a useful privacy homomorphism exist?

  2025cites this paper
• An efficient quantum algorithm for computing S-units and its applications

  2025cites this paper
• Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives

  2025cites this paper
• FrodoKEM: A CCA-Secure Learning With Errors Key Encapsulation Mechanism

  2025cites this paper
• EagleSignV3 : A new secure variant of EagleSign signature over lattices

  2024cites this paper
• Quantum Fast Implementation of Functional Bootstrapping and Private Information Retrieval

  2024cites this paper
• FuLeakage: Breaking FuLeeca by Learning Attacks

  2024influential citation
• A reduction from Hawk to the principal ideal problem in a quaternion algebra

  2024cites this paper
• Finding Dense Submodules with Algebraic Lattice Reduction

  2024cites this paper
• An upper bound on the covering radius of the logarithmic lattice for cyclotomic number fields

  2024cites this paper
• Scloud+: An Efficient LWE-Based KEM Without Ring/Module Structure

  2024cites this paper
• Fully Homomorphic Encryption beyond IND-CCA1 Security: Integrity through Verifiability

  2024cites this paper
• Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs

  2024cites this paper
• Learning with errors over group rings constructed by semi-direct product

  2023cites this paper
• The special case of cyclotomic fields in quantum algorithms for unit groups

  2023cites this paper
• A Novel Power-Sum PRG with Applications to Lattice-Based zkSNARKs

  2023influential citation
• Unit Reducible Cyclotomic Fields

  2023influential citation
• On Pisot Units and the Fundamental Domain of Galois Extensions of $\mathbb{Q}$

  2023cites this paper
• Embedding Integer Lattices as Ideals into Polynomial Rings

  2023influential citation
• The Complexity of the Shortest Vector Problem

  2023cites this paper
• Hardness of Module-LWE with Semiuniform Seeds from Module-NTRU

  2023cites this paper
• Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals

  2023cites this paper
• Universal product learning with errors: A new variant of LWE for lattice-based cryptography

  2022cites this paper
• AKAME: A post-quantum authenticated key-agreement and message encryption scheme based on ring-LWE

  2022cites this paper
• HybridPKE: A forward-secure non-interactive quantum-safe hybrid key exchange scheme

  2022cites this paper
• On the IND-CCA1 Security of FHE Schemes

  2022cites this paper
• An efficient quantum algorithm for lattice problems achieving subexponential approximation factor

  2022cites this paper
• Compact and Efficient NTRU-based KEM with Scalable Ciphertext Compression

  2022cites this paper
• A Survey on Post-Quantum Public-Key Signature Schemes for Secure Vehicular Communications

  2022cites this paper
• Reductions from module lattices to free module lattices, and application to dequantizing module-LLL

  2022cites this paper
• Lattice-based provable data possession in the standard model for cloud-based smart grid data management systems

  2022cites this paper
• Enhancing the Dual Attack against MLWE: Constructing More Short Vectors Using Its Algebraic Structure

  2022cites this paper
• Compact and efficient KEMs over NTRU lattices

  2022cites this paper
• Enhancing Ring-LWE Hardness using Dedekind Index Theorem

  2022cites this paper
• Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography

  2022cites this paper
• Survey on Fully Homomorphic Encryption, Theory, and Applications

  2022cites this paper
• Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable

  2022cites this paper
• Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem

  2022influential citation
• Unit Reducible Fields and Perfect Unary Forms

  2022cites this paper
• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems

  2022cites this paper
• The Influence of Public-Key Cryptography on Mathematics

  2022cites this paper
• On the Short Principal Ideal Problem over some real Kummer fields

  2021influential citation
• Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time

  2021cites this paper
• Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP

  2021influential citation
• Non-randomness of S-unit lattices

  2021cites this paper
• Sublattice Attack on Poly-LWE with Wide Error Distributions

  2021cites this paper
• Error Correction for FrodoKEM Using the Gosset Lattice

  2021cites this paper
• Subfield Algorithms for Ideal- and Module-SVP Based on the Decomposition Group

  2021cites this paper
• Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-based GSW-FHE

  2021cites this paper
• Ring-LWE over two-to-power cyclotomics is not hard

  2021cites this paper
• Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering

  2021cites this paper
• CARiMoL: A Configurable Hardware Accelerator for Ringand Module Lattice-Based Post-Quantum Cryptography

  2021cites this paper
• A short basis of the Stickelberger ideal of a cyclotomic field

  2021cites this paper
• Subset Attacks on Ring-LWE with Wide Error Distributions I

  2021cites this paper
• On Algebraic Embedding for Unstructured Lattices

  2021cites this paper
• Impossibility results for Module LLL based on Euclidean Division

  2021cites this paper
• NTRU Fatigue: How Stretched is Overstretched?

  2021cites this paper
• Lattice-based Key-sharing Schemes

  2021cites this paper
• Homomorphic Encryption for Machine Learning in Medicine and Bioinformatics

  2020cites this paper
• Tasks mapping in the network on a chip using an improved optimization algorithm

  2020cites this paper
• CRYSTALS-Dilithium

  2020cites this paper
• Sublattice Attacks on Ring-LWE with Wide Error Distributions I

  2020cites this paper
• Indistinguishability obfuscation for quantum circuits of low T-count

  2020cites this paper
• On the ideal shortest vector problem over random rational primes

  2020cites this paper
• Non-commutative Ring Learning with Errors from Cyclic Algebras

  2020cites this paper
• Applied Cryptography and Network Security: 18th International Conference, ACNS 2020, Rome, Italy, October 19–22, 2020, Proceedings, Part I

  2020cites this paper
• On the Quantum Complexity of the Continuous Hidden Subgroup Problem

  2020cites this paper
• CRYSTALS-Dilithium-Round 3

  2020cites this paper
• ModFalcon: Compact Signatures Based On Module-NTRU Lattices

  2020cites this paper
• The Lattice-Based Digital Signature Scheme qTESLA

  2020cites this paper
• Random Self-reducibility of Ideal-SVP via Arakelov Random Walks

  2020cites this paper
• Constructions for Quantum Indistinguishability Obfuscation

  2020cites this paper
• NewHope: A Mobile Implementation of a Post-Quantum Cryptographic Key Encapsulation Mechanism

  2020cites this paper
• Fast Reduction of Algebraic Lattices over Cyclotomic Fields

  2020cites this paper
• Short Principal Ideal Problem in multicubic fields

  2020cites this paper
• Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices

  2020cites this paper
• Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE

  2020cites this paper
• Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP

  2020cites this paper
• FrodoKEM Learning With Errors Key Encapsulation Algorithm Specifications And Supporting Documentation

  2019cites this paper
• On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in ℚ(𝜁2𝑠 )

  2019cites this paper
• Solving Ring-LWE over Algebraic Integer Rings

  2019cites this paper
• Practical MP-LWE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MP} \text{- }\mathsf {LWE} $$\end{document}-b

  2019cites this paper
• Ring Signatures Based on Middle-Product Learning with Errors Problems

  2019cites this paper
• Two New Module-Code-Based KEMs with Rank Metric

  2019cites this paper
• Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation

  2019cites this paper
• Statement of Research

  2019cites this paper
• NewHope Algorithm Specifications and Supporting Documentation Original Submitters :

  2019cites this paper
• NewHope Round 2 Cover Sheet

  2019cites this paper
• Strong Post-Compromise Secure Proxy Re-Encryption

  2019cites this paper
• Security is an Architectural Design Constraint

  2019cites this paper
• Approx-SVP in Ideal Lattices with Pre-processing

  2019cites this paper
• On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm

  2019influential citation