Subexponential time relations in the class group of large degree number fields

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Advances in Mathematics of Communications

• Publication date

  2014-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.3934/amc.2014.8.407
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Binary Quadratic Forms An Algorithmic Approach

  2016cited by this paper
• New techniques for computing the ideal class group and a system of fundamental units in number fields

  2012cited by this paper
• Endomorphism Rings in Cryptography

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

  2010influential reference
• Computing isogenies between abelian varieties

  2010influential reference
• A Subexponential Algorithm for Evaluating Large Degree Isogenies

  2010influential reference
• An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves

  2009cited by this paper
• An L(1/3) algorithm for ideal class group and regulator computation in certain number fields

  2009cited by this paper
• A fully homomorphic encryption scheme

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

  2009cited by this paper
• The number field sieve

  2008cited by this paper
• Solving the Pell Equation

  2008cited by this paper
• Binary quadratic forms - an algorithmic approach

  2007cited by this paper
• Improved Analysis of Kannan's Shortest Lattice Vector Algorithm

  2007cited by this paper
• Influence of cultivation temperature on the ligninolytic activity of selected fungal strains

  2006cited by this paper
• The Number Field Sieve in the Medium Prime Case

  2006cited by this paper
• Random Matrices

  2005influential reference
• On ideals free of large prime factors

  2004cited by this paper
• A COMPUTATIONAL APPROACH FOR SOLVING

  2003cited by this paper
• A Signature Scheme Based on the Intractability of Computing Roots

  2002cited by this paper
• Solving the Pell equation

  2002cited by this paper
• First Implementation of Cryptographic Protocols Based on Algebraic Number Fields

  2001cited by this paper
• Asymptotically Fast Discrete Logarithms in Quadratic Number Fields

  2000cited by this paper
• Random matrices, Frobenius eigenvalues, and monodromy

  1998cited by this paper
• A One Way Function Based on Ideal Arithmetic in Number Fields

  1997cited by this paper
• A Subexponential Algorithm for Discrete Logarithms over All Finite Fields

  1993cited by this paper
• Discrete Logarithms in GF(P) Using the Number Field Sieve

  1993cited by this paper
• A subexponential algorithm for the determination of class groups and regulators of algebraic number fields

  1990influential reference
• A rigorous subexponential algorithm for computation of class groups

  1989influential reference
• A Key Exchange System Based on Real Quadratic Fields

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

  1987influential reference
• Heuristics on class groups of number fields

  1984cited by this paper
• An Introduction to the Geometry of Numbers

  1959cited by this paper
• On the Class-Number of the Corpus P(√−k)

  year unknowncited by this paper

• Solving the Decision Principal Ideal Problem with Pre-processing

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

  2024cites this paper
• Fast Practical Lattice Reduction through Iterated Compression

  2023cites this paper
• A proof of the conjectured run time of the Hafner-McCurley class group algorithm

  2023cites this paper
• Efficient computations in central simple algebras using Amitsur cohomology

  2023cites this paper
• Computation of lattice isomorphisms and the integral matrix similarity problem

  2022cites this paper
• The anisotropic part of a quadratic form over a number field

  2021cites 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
• Fast multiquadratic S-unit computation and application to the calculation of class groups

  2019cites this paper
• of the Thirteenth Algorithmic Number Theory Symposium

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

  2019cites this paper
• Principally polarized squares of elliptic curves with field of moduli equal to ℚ

  2018cites this paper
• Security analysis of cryptosystems using short generators over ideal lattices

  2018cites this paper
• Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem

  2018cites this paper
• On the complexity of class group computations for large degree number fields

  2018cites this paper
• Computing the endomorphism ring of an ordinary abelian surface over a finite field

  2018cites this paper
• Recovering Short Generators of Principal Fractional Ideals in Cyclotomic Fields of Conductor pq

  2017cites this paper
• Multilinear Maps Using a Variant of Ring-LWE

  2017cites this paper
• Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme

  2017cites this paper
• Approximate Short Vectors in Ideal Lattices of Q(ζpe) with Precomputation of Cl(OK)

  2017cites this paper
• Class Group Computations in Number Fields and Applications to Cryptology. (Calcul de Groupes de Classes d'un Corps de Nombres et Applications à la Cryptologie)

  2017cites this paper
• A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes

  2016cites this paper
• Recovering Short Generators of Principal Ideals in Cyclotomic Rings

  2016cites this paper
• Polynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings

  2015cites this paper
• N T ] 2 9 O ct 2 01 8 COMPUTING THE ENDOMORPHISM RING OF AN ORDINARY ABELIAN SURFACE OVER A FINITE FIELD

  year unknowncites this paper