#lattices — Public Fediverse posts

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

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

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

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

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

Representing Type Lattices Compactly

https://bernsteinbear.com/blog/lattice-bitset/

#HackerNews #Representing #Type #Lattices #Compactly #TypeLattices #CompactData #Structures #HackerNews #TechBlog #LatticeBitset