Finite field arithmetic in large characteristic for classical and post-quantum cryptography

DOI10.1007/978-3-031-22944-2_5zbMath1529.11126OpenAlexW4315490027MaRDI QIDQ6169004

Sylvain Duquesne

Publication date: 10 August 2023

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22944-2_5

zbMATH Keywords

finite fieldcryptographyarithmeticpolynomial ringsmodular reductionmulti precision

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Missing a trick: Karatsuba variations
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• Choosing and generating parameters for pairing implementation on BN curves
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• Updating key size estimations for pairings
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• An alternative approach for SIDH arithmetic
• An improved RNS variant of the BFV homomorphic encryption scheme
• Guide to Pairing-Based Cryptography
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Kummer Strikes Back: New DH Speed Records
• RNS arithmetic in 𝔽 pk and application to fast pairing computation
• FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction
• Modular Multiplication Without Trial Division
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
• Prime Numbers and Irreducible Polynomials
• An RNS Montgomery modular multiplication algorithm
• Fast Chinese Remaindering in Practice
• Fast Cryptography in Genus 2
• Software Speed Records for Lattice-Based Signatures
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Topics in Computational Number Theory Inspired by Peter L. Montgomery
• Pairing-Friendly Elliptic Curves of Prime Order
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Selected Areas in Cryptography
• Selected Areas in Cryptography
• Mersenne and Fermat Numbers
• Public Key Cryptography - PKC 2006
• Algebraic complexities and algebraic curves over finite fields

This page was built for publication: Finite field arithmetic in large characteristic for classical and post-quantum cryptography