Table of contents

  • This session has been presented December 18, 2015.

Description

  • Speaker

    Shi Bai - Australian National University

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The running-time of the number field sieve depends on the quality of the chosen polynomials. The quality of the chosen polynomials can be modeled in terms of size and root properties. In this talk, we will describe some better algorithms to select polynomials with good size and root properties.<br/> The talk will be based on papers, Shi Bai, Cyril Bouvier, Alexander Kruppa and Paul Zimmermann. Better polynomials for GNFS. Math. Comp, 2015.<br/> Shi Bai, Richard Brent and Emmanuel Thomé. Root optimization of polynomials in the number field sieve. Math. Comp, 2015.

Next sessions

  • Verification of Rust Cryptographic Implementations with Aeneas

    • February 13, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Aymeric Fromherz - Inria

    From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the[…]

  • On the average hardness of SIVP for module lattices of fixed rank

    • March 06, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Radu Toma - Sorbonne Université

    In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…]

  • Journées C2: pas de séminaire

    • April 03, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

  • Endomorphisms via Splittings

    • April 10, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Min-Yi Shen - No Affiliation

    One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]

    • Cryptography

Show previous sessions
Page top