Skip to main content

Switch to dark mode

Search

Show all results for

Home

Publication

Quadratic Sieving

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Thorsten Kleinjung
2016

Abstract

We propose an efficient variant for the initialisation step of quadratic sieving, the sieving step of the quadratic sieve and its variants, which is also used in sieving-based algorithms for computing class groups of quadratic fields. As an application we computed the class groups of imaginary quadratic fields with 100-, 110-, 120-, and 130-digit discriminants.

Official source

https://infoscience.epfl.ch/entities/publication/c3229829-6720-4486-8548-0db6c62685dc

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (18)

Quadratic sieve

The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is considerably simpler than the number field sieve. It is a general-purpose factorization algorithm, meaning that its running time depends solely on the size of the integer to be factored, and not on special structure or properties.

In mathematics, the sieve of Atkin is a modern algorithm for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes, which marks off multiples of primes, the sieve of Atkin does some preliminary work and then marks off multiples of squares of primes, thus achieving a better theoretical asymptotic complexity. It was created in 2003 by A. O. L. Atkin and Daniel J. Bernstein. In the algorithm: All remainders are modulo-sixty remainders (divide the number by 60 and return the remainder).

Quadratic residue

In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract mathematical concept from the branch of number theory known as modular arithmetic, quadratic residues are now used in applications ranging from acoustical engineering to cryptography and the factoring of large numbers.

Related publications (25)

Simulating supercontinua from mixed and cascaded nonlinearities

Luis Guillermo Villanueva Torrijo, Victor Brasch, Furkan Ayhan, Tobias Herr, Thibault Voumard

Nonlinear optical frequency conversion is of fundamental importance in photonics and underpins countless of its applications: Sum- and difference-frequency generation in media with quadratic nonlinearity permits reaching otherwise inaccessible wavelength r ...

AIP Publishing2023

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Rachid Guerraoui, Jovan Komatovic, Manuel José Ribeiro Vidigueira, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

2023

Hierarchy of quasisymmetries and degeneracies in the CoSi family of chiral crystal materials

Philip Johannes Walter Moll, Chunyu Guo, Yi-Chiang Sun

In materials, certain approximated symmetry operations can exist in a lower-order approximation of the effective model but are good enough to influence the physical responses of the system, and these approximated symmetries were recently dubbed "quasisymme ...

AMER PHYSICAL SOC2023