Reduction modulo 2⁴⁴⁸-2²²⁴-1

MaRDI QIDQ7231671zbMATH OpenFDO

Authors Kaushik Nath, Palash Sarkar

Publication date 22 April 2026

Published in Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://journals.flvc.org/mathcryptology/article/view/123700

zbMATH Keywords

Curve448Diffie-Hellman key agreementelliptic curve cryptographyGoldilocks primemodulo reduction

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Efficient arithmetic in (pseudo-)Mersenne prime order fields
• Fast implementation of Curve25519 using AVX2
• High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
• How to (pre-)compute a ladder -- improving the performance of X25519 and X448
• Modular Multiplication Without Trial Division
• Montgomery Curves and the Montgomery Ladder
• Public Key Cryptography - PKC 2006
• Sandy2x: new Curve25519 speed records

This page was built for publication: Reduction modulo \(2^{448}-2^{224}-1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231671)