@isogenies

One half of @CryptoHack__, Cryptography consultant, PhD Black Holes and Supergravity 🚩@0rganizers

giacomopope.com
Joined February 2020
  • Tweets1.3K
  • Following203
  • Followers976
98Media
It works!! Here's a @sagemath implementation of the SIDH Key Recovery attack of Castryck and Decru. Huge thanks to @oudomphe. Their insights allowed us to directly compute the image of points in the Jacobian through divisors. No Gröbner needed! github.com/jack4818/Castryck…

GitHub - GiacomoPope/Castryck-Decru-SageMath: A SageMath implementation of the Castryck-Decru Key...

A SageMath implementation of the Castryck-Decru Key Recovery attack on SIDH - GiacomoPope/Castryck-Decru-SageMath

github.com
7
57
1
180
This week I have been working on some rust code to develop a library for isogeny based cryptography. As a first project, I have implemented SQIsign verification following the round 2 NIST spec. github.com/GiacomoPope/isoge…

GitHub - GiacomoPope/isogeny_rs: Rust library for isogeny-based cryptography

Rust library for isogeny-based cryptography. Contribute to GiacomoPope/isogeny_rs development by creating an account on GitHub.

github.com
1
3
20
1,552
I am retiring from teaching GR. Here is the final course material (lecture notes including all problem sets and exams). Hope some students might find it useful in their studies. tinyurl.com/5n786bkn [Thanks to @gimmytomas for his amazing help in making the exam questions.]
55
293
26
1,786
125,044
New paper with lots of my friends on computing isogeny-based hash functions using the theta model. Was fun to implement something which benchmarked at the micro rather than millisecond timescale for a change! 🍄 eprint.iacr.org/2024/1732
1
4
42
2,648
We find 2, 4 and 8-radical isogeny formula in dim 1, 2 and 3. For higher genus, the more complex l-isogeny graph allows us to use a smaller base field. The bottleneck of the radical isogenies are roots, which get cheaper as the prime shrinks, improving performance of the hash
3
379
Random walks in number-theoretic cryptology: on Thursday (Aug. 29, 2pm CEST) I'll be defending my "habilitation". I'll present an overview of the research I've done in the past few years. Isogenies, lattices... Zoom link, manuscript, and more info there: bweso.com/hdr.php
1
9
34
3,659
kyber-py and dilithium-py have both been updated to match the finalised FIPS specifications 203 and 204. They also both pass the test vectors supplied by usnistgov/ACVP-Server I hope these are useful tools to learn PQ crypto 🍄 github.com/GiacomoPope/dilit… github.com/GiacomoPope/kyber…

GitHub - GiacomoPope/dilithium-py: A pure python implementation of ML-DSA (FIPS 204) and CRYSTALS...

A pure python implementation of ML-DSA (FIPS 204) and CRYSTALS-Dilithium - GiacomoPope/dilithium-py

github.com
7
39
2,537
Giacomo 🪿 retweeted
asanso
@asanso13 Aug 2024
Hey class groups lovers. Back from holiday and started reading ANTS XVI papers. Apart the obvious Selfridge prize winner 'Fast square-free decomposition of integers using class groups' antsmath.org/ANTSXVI/papers/… here some other gem 1/2
1
1
1
10
1,697
We now support the Ascon XOFs too!
Giacomo 🪿@isogenies30 Jul 2024
This weekend I made xoflib with my friends Robin Jadoul and @_tritoke. xoflib is a Python package for the Shake extendable-output functions (XOFs) written using pyO3 bindings to the sha3 Rust crate. github.com/GiacomoPope/xofli…

GitHub - GiacomoPope/xoflib: A Python package build using pyO3 rust bindings to various extendabl...

A Python package build using pyO3 rust bindings to various extendable-output functions (XOFs): including Ascon, BLAKE3, Shake and TurboShake - GiacomoPope/xoflib

github.com
5
381
This weekend I made xoflib with my friends Robin Jadoul and @_tritoke. xoflib is a Python package for the Shake extendable-output functions (XOFs) written using pyO3 bindings to the sha3 Rust crate. github.com/GiacomoPope/xofli…

GitHub - GiacomoPope/xoflib: A Python package build using pyO3 rust bindings to various extendabl...

A Python package build using pyO3 rust bindings to various extendable-output functions (XOFs): including Ascon, BLAKE3, Shake and TurboShake - GiacomoPope/xoflib

github.com
1
2
1
9
1,834
more replies
Here's a side by side of hashlib vs xoflib which shows the issues which people have when the required use of the algorithm is streaming byte after byte (this is exactly what is done for polynomial creation for ML-KEM and ML-DSA)
1
3
265
Main takeaway from this project though was how easy pyO3 is to use and maturin made uploading the package trivial too. Definitely inspired to use python bindings for rust code to solve projects more often now.
4
333
So it turns out all my Dilithium hint confusion was very carefully written about in the... Dilithium spec. I added a small discussion in the README of the Python implementation too with some links to the source code as well: github.com/GiacomoPope/dilit…
2
9
507
I implemented ML-DSA following draft FIPS 204 to follow the work earlier this week with ML-KEM. Hopefully this is interesting to people learning about the protocol github.com/GiacomoPope/dilit…

GitHub - GiacomoPope/dilithium-py: A pure python implementation of ML-DSA (FIPS 204) and CRYSTALS...

A pure python implementation of ML-DSA (FIPS 204) and CRYSTALS-Dilithium - GiacomoPope/dilithium-py

github.com
1
4
1
18
2,011
I also have a silly bug somewhere, if you fix it that would be cool! github.com/GiacomoPope/dilit…

`make_hint()` is buggy · Issue #2 · GiacomoPope/dilithium-py

The function make_hint() should be very easy: def make_hint(z, r, a, q): r1 = high_bits(r, a, q) v1 = high_bits(r + z, a, q) return int(r1 != v1) but when implemented like this, sometimes signature...

github.com
1
1
545
Fixed :)
1
162
Bug was with my understanding of an optimisation, not with the code or FIPS 204 document. Everything works as expected. Discussion here: github.com/GiacomoPope/dilit…

`make_hint()` is buggy · Issue #2 · GiacomoPope/dilithium-py

The function make_hint() should be very easy: def make_hint(z, r, a, q): r1 = high_bits(r, a, q) v1 = high_bits(r + z, a, q) return int(r1 != v1) but when implemented like this, sometimes signature...

github.com
Giacomo 🪿@isogenies25 Jul 2024
Replying to @isogenies
I also have a silly bug somewhere, if you fix it that would be cool! github.com/GiacomoPope/dilit…

`make_hint()` is buggy · Issue #2 · GiacomoPope/dilithium-py

The function make_hint() should be very easy: def make_hint(z, r, a, q): r1 = high_bits(r, a, q) v1 = high_bits(r + z, a, q) return int(r1 != v1) but when implemented like this, sometimes signature...

github.com
2
279
I've been looking at my old Dilithium implementation in Python to add an additional file for ML-DSA and I have an old bug I forgot about and can't squish with the make_hint() method. 🐛 Any advice? github.com/GiacomoPope/dilit…

`make_hint()` is buggy · Issue #2 · GiacomoPope/dilithium-py

The function make_hint() should be very easy: def make_hint(z, r, a, q): r1 = high_bits(r, a, q) v1 = high_bits(r + z, a, q) return int(r1 != v1) but when implemented like this, sometimes signature...

github.com
1
4
404
I can't find an implementation which implements following FIPS 204 exactly, but I can find other implementations which seem to need to use the Dilithium version... github.com/paulmillr/noble-p…

noble-post-quantum/src/ml-dsa.ts at fccc897cfac0a59e54d4478cfbd62e97662f2417 · paulmillr/noble-po...

Auditable & minimal JS implementation of public-key post-quantum cryptography - paulmillr/noble-post-quantum

github.com
161
The PR for github.com/sagemath/sage/pul… was a bit of a rabbit hole, but we finally removed the 100x slowdown of int(k) * P versus ZZ(k) * P for elliptic curve scalar multiplication

Faster scalar multiplication for python types by GiacomoPope · Pull Request #37369 · sagemath/sage

There is an annoying problem at the moment. If you compute the scalar multiplication of a point on an elliptic curve over a finite field, a fast call to Pari is made when the scalar is a Sage type,...

github.com
This Post is from an account that no longer exists. Learn more
2
25
1,595
Load more