J
Joost Renes
Researcher at Radboud University Nijmegen
Publications - 31
Citations - 780
Joost Renes is an academic researcher from Radboud University Nijmegen. The author has contributed to research in topics: Computer science & Elliptic curve. The author has an hindex of 11, co-authored 22 publications receiving 487 citations. Previous affiliations of Joost Renes include NXP Semiconductors.
Papers
More filters
Book ChapterDOI
CSIDH: an efficient Post-Quantum Commutative Group Action
TL;DR: The Diffie–Hellman scheme resulting from the group action allows for public-key validation at very little cost, runs reasonably fast in practice, and has public keys of only 64 bytes at a conjectured AES-128 security level, matching NIST’s post-quantum security category I.
Book ChapterDOI
Efficient Compression of SIDH Public Keys
TL;DR: A recent paper by Azarderakhsh, Jao, Kalach, Koziel and Leonardi showed that the public keys defined in Jao and De Feo's original SIDH scheme can be further compressed by around a factor of two.
Book ChapterDOI
Computing Isogenies Between Montgomery Curves Using the Action of (0, 0)
TL;DR: Costello and Hisil as discussed by the authors showed the connection between the shape of the isogeny and the simple action of the point \((0,0), and provided efficient formulas for 2-isogenies between Montgomery curves and showed that these formulas can be used in isogeniness-based cryptosystems without expensive square root computations and without knowledge of a special point of order 8.
Posted Content
Complete addition formulas for prime order elliptic curves.
TL;DR: This paper presents optimized addition formulas that are complete on every prime order short Weierstrass curve defined over a field k with $$\mathrm{char}k
e 2,3$$charki¾?2,3 and discusses how these formulas can be used to achieve secure, exception-free implementations on all of the prime order curves in the NIST and many other standards.
Book ChapterDOI
Complete Addition Formulas for Prime Order Elliptic Curves
TL;DR: In this article, the authors presented a complete ECC algorithm for prime-order Weierstrass curves with field multiplications of 2,3 for elliptic curve groups and showed how these can be used to achieve secure, exception-free implementations on all of the prime order curves in the NIST and many other standards.