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

📌 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).

https://github.com/FiloSottile/ecc-vs-lattices-long-bet

GitHub - FiloSottile/ecc-vs-lattices-long-bet: A long bet between Matthew Green and Filippo Valsorda on what will break first: ML-KEM-768 or X25519. You can join! Money goes to charity.

A long bet between Matthew Green and Filippo Valsorda on what will break first: ML-KEM-768 or X25519. You can join! Money goes to charity. - FiloSottile/ecc-vs-lattices-long-bet

GitHub

Meet "spinodoid" structures. You basically splash lots of waves in all sorts of random directions with random phases, and then you threshold the resulting mess.
These structures stem from the idea of a "spinodal decomposition" and the waves form a "Gaussian random field". The latter has been linked to/used for animal patterns (stripes etc), phase separation in chemistry/metallurgy, quantum mechanical random fields, up to cosmological structures...
But here I just use it to create stochastic lattice structures. Because my waves here have different orientations but the same frequency, they show up in a Fourier transform as a circle or sphere, which I think is just neat :)

Spinodoids are coming to Comodo very soon.

More on Spinodoids:
https://doi.org/10.1038/s41524-020-0341-6

Spinodal decomposition:
https://en.wikipedia.org/wiki/Spinodal_decomposition

Gaussian random fields:
https://en.wikipedia.org/wiki/Gaussian_random_field

#opensource #Julialang #GeometryProcessing #Lattices

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. https://www.quantamagazine.org/new-sphere-packing-record-stems-from-an-unexpected-source-20250707/ New #SpherePacking Record Stems From an Unexpected Source | Quanta Magazine
New Sphere-Packing Record Stems From an Unexpected Source | Quanta Magazine

After just a few months of work, a complete newcomer to the world of sphere packing has solved one of its biggest open problems.

Quanta Magazine
Representing type lattices compactly

The Cinder JIT compiler does some cool stuff with how they represent types so I’m going to share it with you here. The core of it is thinking about types as sets (lattices, even), and picking a compact representation. Compilers will create and manipulate types with abandon, so all operations have to be fast.

Max Bernstein

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
https://eprint.iacr.org/2024/1681

Another L makes it better? Lagrange meets LLL and may improve BKZ pre-processing

We present a new variant of the LLL lattice reduction algorithm, inspired by Lagrange notion of pair-wise reduction, called L4. Similar to LLL, our algorithm is polynomial in the dimension of the input lattice, as well as in $\log M$, where $M$ is an upper-bound on the norm of the longest vector of the input basis. We experimentally compared the norm of the first basis vector obtained with LLL and L4 up to dimension 200. On average we obtain vectors that are up to $16\%$ shorter. We also used our algorithm as a pre-processing step for the BKZ lattice reduction algorithm with blocksize 24. In practice, up to dimension 140, this allows us to reduce the norm of the shortest basis vector on average by $3\%$, while the runtime does not significantly increases. In $10\%$ of our tests, the whole process was even faster.

IACR Cryptology ePrint Archive

@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]

https://link.springer.com/article/10.1007/s10670-022-00643-6

Luck and Proportions of Infinite Sets - Erkenntnis

SpringerLink

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 @[email protected]

[1]: https://www.quantamagazine.org/celebrated-cryptography-algorithm-gets-an-upgrade-20231214/
[2]: https://www.iacr.org/cryptodb/data/paper.php?pubkey=33301
#Lattices #cryptography #postquantum

Celebrated Cryptography Algorithm Gets an Upgrade | Quanta Magazine

Two researchers have improved a well-known technique for lattice basis reduction, opening up new avenues for practical experiments in cryptography and mathematics.

Quanta Magazine
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
https://eprint.iacr.org/2023/1125
Finding short integer solutions when the modulus is small

Lattice Convolutional Networks for Learning Ground States of Quantum Many-Body Systems

https://openreview.net/forum?id=GaQBRQ4Prt

#lattice #lattices #convolutions

Lattice Convolutional Networks for Learning Ground States of...

Deep learning methods have been shown to be effective in representing ground-state wave functions of quantum many-body systems. Existing methods use convolutional neural networks (CNNs) for square...

OpenReview