Cryptographer at IBM Research. Interested in all aspects of cryptography, but I mostly work on Post-Quantum stuff.
Zurich, Switzerland
Joined June 2012
- Tweets113
- Following113
- Followers906
- Likes1.1K
Ward Beullens retweeted
"Why we cannot wait for better post-quantum signature algorithms" by @bwesterb and @cjpatton_ :
blog.cloudflare.com/ml-dsa-w…
Ward Beullens retweeted
Spotlighting Greyhound 🐾, the new amazing work from @KhanhCrypto and @gregor_seiler!
A new super fast and compact polynomial commitments from standard lattice assumptions!
📚: ia.cr/2024/1293
👨💻: github.com/lattice-dogs/labr…
Ward Beullens retweeted
This is a very nice website on what women in academia face,as "We start our summary by stating common gender stereotypes such as "women just need to act like men to succeed in academia" or "academia is fair and objective - women are just not good enough".
sites.google.com/view/womeni…
Ward Beullens retweeted
If you are around for the NIST's Fifth PQC Standardization Conference, go check our MAYO poster and talk to Matthias Kannwischer or @WardBeullens . They will presented our paper: eprint.iacr.org/2023/1683 and our poster!
Ward Beullens retweeted
Thanks to all participants of #AfricaCrypt_2023. It was a pleasure to meet all of you ;-)
Ward Beullens retweeted
Just looking at the sizes, PQMayo is the most promising submission to the NIST on-ramp I’ve seen. Also the cycle counts are better than expected. Just needs thorough cryptanalysis. 🤞
Our beautiful PQC scheme MAYO is fast and has super nice parameters. Check them out in: pqmayo.org/ (with new spec, numbers and code) by @WardBeullens @primaboinca Matthias Kannwischer and Basil Hess!
Ward Beullens retweeted
#Job PhD or Postdoc in isogeny-based cryptography: IBM Research Zürich iacr.org/jobs/item/3355
Ward Beullens retweeted
Recently out of the over is the MAYO-sage code: github.com/PQCMayo/MAYO-sage, where we aimed at creating an easy to follow implementation of the PQC scheme MAYO.
Isogenists have had a monopoly on pretty graphs for far too long! (By the way, I don't know why these graphs look the way they do, if you find out please let me know...)
#ePrint Graph-theorethic Algorithms for the Alternating Trilinear Form Equivalence problem: W Beullens ia.cr/2022/1528
Ward Beullens retweeted
Since 1969 Strassen’s algorithm has famously stood as the fastest way to multiply 2 matrices - but with #AlphaTensor we’ve found a new algorithm that’s faster, with potential to improve efficiency by 10-20% across trillions of calculations per day! dpmd.ai/dm-alpha-tensor
Ward Beullens retweeted
The PQC scheme MAYO has now a brand new website, logo and more! Check it out: pqmayo.org/ Made with love with @WardBeullens !
Ward Beullens retweeted
Tim Beyne blogged from #crypto2022 on Ward Beullens' paper "Breaking Rainbow takes a weekend on a laptop", check it out here: esat.kuleuven.be/cosic/blog/…
Ward Beullens retweeted
#ePrint An efficient key recovery attack on SIDH (preliminary version): W Castryck, T Decru ia.cr/2022/975
Ward Beullens retweeted
There's a new bi-weekly seminar on an oddly specific topic in town! @KrijnReijnders and I are happy to announce that the Isogeny Club will start this fall! Spread the word!
the-isogeny-club.github.io/
1997: IBM's DeepBlue vs. Kasparov
2016: Google's AlphaGo vs. Lee Sedol
202X: Meta's SALSA vs. @tmmlaarhoven?
My money is on Thijs for now.
#ePrint SALSA: Attacking Lattice Cryptography with Transformers: E Wenger, M Chen, F Charton, K Lauter ia.cr/2022/935
