ellipticnews
The Elliptic Curve Cryptography blog
- Posts
- 143 from 12 Nov 2010 to 29 Oct 2026
- Posting
- now and then (1 in the last year)
- Kind
- personal blog
- Feed
- https://ellipticnews.wordpress.com/feed/
2026 1
2025 1
2024 1
2023 5
2022 3
2021 3
2020 12
- SQISign
- Review of ECC 2020
- ECC 2020 Conference
- PQCrypto 2020 and other news
- CRYPTO 2020
- The second half of ANTS 2020
- The first half of ANTS 2020
- Eurocrypt 2020
- May 2020, What’s new?
- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory
- Algorithmic Number Theory (ANTS-XIV)
- Various news items
2019 8
- Isogeny crypto
- An attendee’s report: crypto means Crypto (2019)
- SIAM Conference on Applied Algebraic Geometry 2019
- ECC 2019, Bochum, December 2-4
- PQCrypto 2019
- Recent work on pairing inversion
- AMS Sectional Meeting Special Session on The Mathematics of Cryptography
- Accepted papers to Eurocrypt, PQ Crypto and PKC 2019
2018 13
- Blog post on CSIDH and video of talk
- Asiacrypt 2018
- ECC 2018, Osaka, Japan
- Mathematics of Public Key Cryptography textbook free
- ECC 2018 Conference, Osaka, Japan
- MathCrypt 2018
- ANTS 2018
- Tri-linear maps from elliptic curves and abelian surfaces
- Eurocrypt 2018
- 114-bit ECDLP solved on a curve with automorphisms over a prime field
- Isogeny crypto at PQCrypto 2018
- Cryptographic tri-linear maps
- Various news, mostly about isogeny cryptography
2017 8
2016 13
- Asiacrypt 2016
- New ECDLP record
- ECC 2016, İzmir
- Twelfth Algorithmic Number Theory Symposium, Kaiserslautern, 2016
- CRYPTO and CHES 2016, Santa Barbara, CA, USA
- eprint 2016/704
- Upcoming conferences and recent announcements
- Complete group laws for prime-order elliptic curves: a step towards safer implementations of standard curves
- Kim–Barbulescu variant of the Number Field Sieve to compute discrete logarithms in finite fields
- ECDLP in less than square-root time
- ECDLP is not broken in 24-th root time
- ECDLP can be solved in 24-th root time
- eprint 2016/003 by Nicolas Courtois
2015 13
- Asiacrypt 2015, Auckland, New Zealand
- ECC 2015, Bordeaux, France, September 28-30, 2015.
- NIST workshop and Chinese mirror site
- Latincrypt accepted papers
- Elliptic Curve Cryptography conference, September 28-30, Bordeaux, France.
- Accepted papers at CRYPTO
- Public Key Cryptography 2015, Gaithersburg, USA
- Accepted presentations to NIST workshop on ECC standards
- Elliptic curve discrete logarithm problem in characteristic two
- Soliloquy, ideal lattices, and algorithms
- EUROCRYPT 2015 accepted papers
- New 113-bit ECDLP record
- Standardising specific elliptic curves
2014 10
- Asiacrypt 2014, Kaohsiung, Taiwan
- ECC 2014, Chennai
- Day Two of ANTS 2014
- CRYPTO and ANTS accepted papers
- DLP workshop Ascona. Second and final part.
- DLP workshop, Ascona
- ECC 2014, Chennai, India, October 8–10.
- Scott Vanstone
- New discrete logarithm records, and the death of Type 1 pairings
- Algorithmic Number Theory Conference, 2014
2013 19
- ASIACRYPT 2013, Bangalore
- Pairing 2013
- Elliptic Curve Cryptography in Practice
- Pairing 2013 conference
- Recent work on pairing inversion
- ECC2013
- Asiacrypt 2013 accepted papers
- Geocrypt 2013, Tahiti
- ECC 2013 Conference
- CRYPTO 2013
- SAC 2013
- Razvan Barbulescu, Emmanuel Thomé and Antoine Joux
- Quasi-polynomial-time algorithm for discrete logarithm in finite fields of small/medium characteristic
- Eurocrypt 2013 and the Gödel Prize
- Joux kills pairings in characteristic 2
- 809 bit finite field discrete logarithms
- New results on the discrete logarithm problem in finite fields of small characteristic
- Accepted papers for EUROCRYPT 2013
- Richard Crandall
2012 14
- David G. Cantor
- Asiacrypt 2012
- Multi-linear maps
- ECC 2012
- ECC2012 conference talks streamed live
- recent news
- ANTS 2012
- New finite field discrete log record.
- PKC 2012
- Pairing 2012
- Two new papers on the ECDLP in characteristic 2
- What on earth is “index calculus”?
- ECC conferences
- The Eurocrypt 2012 paper of Joux and Vitse