home.social

#lattices — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #lattices, aggregated by home.social.

fetched live
  1. MOSS Season 2 continues next week.

    🎙️ Benjamin Wesolowski (CNRS & ENS Lyon, France)

    Talk title: Random walks in number-theoretic cryptology

    🗓️ Thursday, 7 May 2026 • 🕓 4:00 PM CEST • Online

    Abstract: Cryptography met number theory in 1976, when Diffie and Hellman achieved what had long been considered impossible: a protocol for two people to exchange secret information on a public channel, even if they had never met before to establish some kind of password, a pre-shared key. Diffie and Hellman designed the protocol such that a spy attempting to find the secret would need to solve a presumably hard computational problem: the discrete logarithm problem in the multiplicative group of a finite field.

    Since then, number theory has consistently met the challenges of cryptography, offering a variety of difficult algorithmic problems and powerful tools for their analysis. In this talk, we will explore this “mathematical cryptology”, with a focus on euclidean lattices (designed to resist against quantum computers), the use of random walks, and how spectral methods in number theory apply to cryptology.

    ----------------------------------------------

    Scan the QR code in the image to join the mailing list and receive the online access link.

    #Mathematics #NumberTheory #Cryptography #Lattices #PostQuantum #MOSS #EMS

  2. MOSS Season 2 continues next week.

    🎙️ Benjamin Wesolowski (CNRS & ENS Lyon, France)

    Talk title: Random walks in number-theoretic cryptology

    🗓️ Thursday, 7 May 2026 • 🕓 4:00 PM CEST • Online

    Abstract: Cryptography met number theory in 1976, when Diffie and Hellman achieved what had long been considered impossible: a protocol for two people to exchange secret information on a public channel, even if they had never met before to establish some kind of password, a pre-shared key. Diffie and Hellman designed the protocol such that a spy attempting to find the secret would need to solve a presumably hard computational problem: the discrete logarithm problem in the multiplicative group of a finite field.

    Since then, number theory has consistently met the challenges of cryptography, offering a variety of difficult algorithmic problems and powerful tools for their analysis. In this talk, we will explore this “mathematical cryptology”, with a focus on euclidean lattices (designed to resist against quantum computers), the use of random walks, and how spectral methods in number theory apply to cryptology.

    ----------------------------------------------

    Scan the QR code in the image to join the mailing list and receive the online access link.

    #Mathematics #NumberTheory #Cryptography #Lattices #PostQuantum #MOSS #EMS

  3. 📌 April-26:

    The official bets are in: #Lattices vs #X25519 the #cryptographers 📈 #polymarket is open.

    👉 My money would be on team @djb and @matthew_d_green

    Any new #postquantum hard assumption will fail before #quantumcomputers deliver.

    If @filippo pq apocalyptic timeframe is correct, only expensive, well understood, hash tree based signatures like #SPHINCS will save our ass (again).

    github.com/FiloSottile/ecc-vs-

  4. Lattices and sphere packing - when #Math gets really fun and interesting. A recent development in the #Mathematics world raises the ante in the pursuit of optimal sphere packing in multiple high dimensions. Turns out #lattices and ellipsoids are central to the latest piece of the puzzle. This is for my #MathNerd followers🤓 who enjoy a mind-tweaking read. quantamagazine.org/new-sphere- New #SpherePacking Record Stems From an Unexpected Source | Quanta Magazine

  5. Lattices and sphere packing - when #Math gets really fun and interesting. A recent development in the #Mathematics world raises the ante in the pursuit of optimal sphere packing in multiple high dimensions. Turns out #lattices and ellipsoids are central to the latest piece of the puzzle. This is for my #MathNerd followers🤓 who enjoy a mind-tweaking read. quantamagazine.org/new-sphere- New #SpherePacking Record Stems From an Unexpected Source | Quanta Magazine

  6. More “L”s is better? Adding Lagrange's algorithm to the LLL lattice reduction produces vectors that are shorter without affecting much of the runtime.

    Lenstra–Lenstra–Lovász-Lagrange is a mouthful, so thankfully the authors introduce this algorithm with the L4 name.

    #Lattices #PQC #SVP
    eprint.iacr.org/2024/1681

  7. More “L”s is better? Adding Lagrange's algorithm to the LLL lattice reduction produces vectors that are shorter without affecting much of the runtime.

    Lenstra–Lenstra–Lovász-Lagrange is a mouthful, so thankfully the authors introduce this algorithm with the L4 name.

    #Lattices #PQC #SVP
    eprint.iacr.org/2024/1681

  8. @philosophy
    #infinite #math

    nice take in 2 1/2 open acccess pages,

    wrt #philosophers were well advised to not limiting the scope of their attention to #cardinal #numbers when referring to the #math #infinite. equally important [besides #ordering #structures and especially #ordinal #numbers] are e.g. #measures on #infinite #Booelan #lattices [#probability only a special case of these]

    link.springer.com/article/10.1

  9. @philosophy
    #infinite #math

    nice take in 2 1/2 open acccess pages,

    wrt #philosophers were well advised to not limiting the scope of their attention to #cardinal #numbers when referring to the #math #infinite. equally important [besides #ordering #structures and especially #ordinal #numbers] are e.g. #measures on #infinite #Booelan #lattices [#probability only a special case of these]

    link.springer.com/article/10.1

  10. Great highlight [1] by @QuantaMagazine on the work done [2] by Keegan Ryan and Nadia Heninger on improving the efficiency of the LLL algorithm using multiple techniques such as recursive structure and precision of numbers involved.
    Featuring @ducasleo

    [1]: quantamagazine.org/celebrated-
    [2]: iacr.org/cryptodb/data/paper.p
    #Lattices #cryptography #postquantum

  11. Great highlight [1] by @QuantaMagazine on the work done [2] by Keegan Ryan and Nadia Heninger on improving the efficiency of the LLL algorithm using multiple techniques such as recursive structure and precision of numbers involved.
    Featuring @ducasleo

    [1]: quantamagazine.org/celebrated-
    [2]: iacr.org/cryptodb/data/paper.p
    #Lattices #cryptography #postquantum

  12. Interesting cryptanalytic result for the lattice inhomogenous short integer solution problem with small moduli. If such small moduli would be used in the FALCON scheme, the estimated security against signature forgery would be reduced by approximately 26 bits. #PostQuantum #Lattices #ISIS
    eprint.iacr.org/2023/1125

  13. Interesting cryptanalytic result for the lattice inhomogenous short integer solution problem with small moduli. If such small moduli would be used in the FALCON scheme, the estimated security against signature forgery would be reduced by approximately 26 bits. #PostQuantum #Lattices #ISIS
    eprint.iacr.org/2023/1125

  14. CW: research review

    A. Berzati et al., "A Practical Template Attack on CRYSTALS-Dilithium"¹

    This paper presents a new profiling side-channel attack on the signature scheme CRYSTALS-Dilithium, which has been selected by the NIST as the new primary standard for quantum-safe digital signatures. This algorithm has a constant-time implementation with consideration for side-channel resilience. However, it does not protect against attacks that exploit intermediate data leakage. We exploit such a leakage on a vector generated during the signing process and whose costly protection by masking is a matter of debate. We design a template attack that enables us to efficiently predict whether a given coefficient in one coordinate of this vector is zero or not. Once this value has been completely reconstructed, one can recover, using linear algebra methods, part of the secret key that is sufficient to produce universal forgeries. While our paper deeply discusses the theoretical attack path, it also demonstrates the validity of the assumption regarding the required leakage model, from practical experiments with the reference implementation on an ARM Cortex-M4.

    #IACR #ResearchPapers #Dilithium #Lattices #PQCryptography #SideChannelAttacks #TemplateAttacks
    __
    ¹ eprint.iacr.org/2023/050

  15. CW: research review

    J. Surin and S. Cohney, "A Gentle Tutorial for Lattice-Based Cryptanalysis"¹

    The applicability of lattice reduction to a wide variety of cryptographic situations makes it an important part of the cryptanalyst's toolbox. Despite this, the construction of lattices and use of lattice reduction algorithms for cryptanalysis continue to be somewhat difficult to understand for beginners. This tutorial aims to be a gentle but detailed introduction to lattice-based cryptanalysis targeted towards the novice cryptanalyst with little to no background in lattices. We explain some popular attacks through a conceptual model that simplifies the various components of a lattice attack.

    #IACR #ResearchPapers #Lattices #Tutorials
    __
    ¹ eprint.iacr.org/2023/032

  16. Do you want to see what post-quantum ⚛️ crypto looks like in a web browser 🌐 ? Try out the revised, expanded, and improved OpenSSLNTRU demo!
    opensslntru.cr.yp.to/ :OpenAccess:

    ⚗️ A joint work with @hashbreaker, Billy Brumley (@NISEC_TAU), and Ming-Shing Chen.

    #PQC #NTRUPrime #cryptography #lattices #OpenSSL