One week to go until the online event Celebrating 40 years of Elliptic Curves in Cryptography (ECC). You can hear from Koblitz and Miller about their work 40 years ago https://t.co/62oEE0Exx8

ECC 2025 11 August 2025, online Celebrating 40 years of Elliptic Curves in Cryptography (ECC) https://t.co/62oEE0F5mG

Tuesday, December 10, University of Auckland "The mathematics of solitaire" Public lecture by Persi Diaconis who is not only a mathematician and statistician but a professional magician Book now to reserve a seat. These are going to go fast. https://t.co/8tPV29BOQ9

If you are coming to the joint meeting of the New Zealand,  Australian, and American math societies in 9 days, then here is a photo of the conference dinner venue

Tuesday, December 10, University of Auckland "The mathematics of solitaire" Public lecture by Persi Diaconis who is not only a mathematician and statistician but a professional magician Book now to reserve a seat. These are going to go fast. https://t.co/8tPV29BOQ9

@mr_poivron @dallairedemers @hashbreaker There are alternative proposals for public key encryption which I discuss in that survey (including one I made). But I think it’s fair to say that none of them, isogenies included, has received enough study to have confidence in it.

While crypto experts are scrutinizing every detail of the new paper, as a precautionary measure we strongly advise everyone to temporarily switch all your digital communications to pigeon post.

PKC 24 program is up, and registration open! with great papers, awesome invited talks from @sol3gga and @nadiaheninger, exotic excursion and cruise banquet, and the lovely little logo @Wsusilo, see you in Sydney~

Just read in the LMS Newsletter: Nelson Stephens and Dominic Welsh have both died. Two mathematicians whose work was crucial to my initial career development. Nelson for being my PhD external examiner and mentor at Cardiff, and Dominic for his lovely book on cryptography

PS. Paper will appear at PKC 2024

We give a much simpler and tighter reduction, that only needs 1/\eps^4 calls to the CDH oracle. We build heavily on the work of Montgomery and Zhandry, but replace the most tricky parts with a much simpler statistical distinguisher. (4/5)

In 2018 L Panny, B Smith, F Vercauteren and I showed a quantum reduction of DLog to CDH for group actions, for a perfect correct CDH oracle. This arises from CSIDH key exchange: breaking the key exchange is equivalent to (quantumly) solving the group action problem. (2/5)

SIS estimates have landed in https://t.co/U5AKkaQuhf thanks to Hunter Kippen (who is not on this website) who did this work during his residency with us at @SandboxAQ

This is a graph of Taxpayers Union income and cash reserves over time. There was a really really big surge of money coming in from 2020. I wonder what the reason was and where the money came from?

Right-wingers finding out that Greenday hates them is like when they found out that Rage Against The Machine hates them, which was like when they found out that Neil Young & Bruce Springsteen hate them, which was like when they found out that their wives & kids hate them, which w

I love this.

It feels very anticlimactic, given that a number of governments have been working for years to stop or slow down this deployment. Universal deployment of end-to-end feels basically unstoppable at this point.

@heydari_be Yes only requires about O(2n) FAULT TOLERANT qubits to break n-bit RSA. But it is making each qubit fault tolerant which is the problem. That requires quantum error correction, which is expensive (or at least it was last time I read some stuff on this).