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

DOI10.1007/978-3-031-22944-2_5MaRDI QIDQ6169004zbMATH OpenOpenAlexFDO

Authors 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

arithmeticcryptographyfinite fieldmodular reductionmulti precisionpolynomial rings

Mathematics Subject Classification ID

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

Recommendations

• Efficient finite field multiplication for isogeny based post quantum cryptography
• Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography
• Efficient software-implementation of finite fields with applications to cryptography
• Efficient hardware implementation of finite fields with applications to cryptography
• Arithmetic of binary finite fields

Cites work

• A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
• Algebraic complexities and algebraic curves over finite fields
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An alternative approach for SIDH arithmetic
• An improved RNS variant of the BFV homomorphic encryption scheme
• An RNS Montgomery modular multiplication algorithm
• Choosing and generating parameters for pairing implementation on BN curves
• Combining leak-resistant arithmetic for elliptic curves defined over F_p and RNS representation
• Cox-Rower architecture for fast parallel Montgomery multiplication
• Curves with Fast Computations in the First Pairing Group
• Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\)
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• Extended tower number field sieve: a new complexity for the medium prime case
• Fast Chinese remaindering in practice
• Fast cryptography in genus 2
• FPGA implementation of pairings using residue number system and lazy reduction
• Guide to pairing-based cryptography
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 1302865 (Why is no real title available?)
• scientific article; zbMATH DE number 1024055 (Why is no real title available?)
• scientific article; zbMATH DE number 1440071 (Why is no real title available?)
• scientific article; zbMATH DE number 3269473 (Why is no real title available?)
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Kummer strikes back: new DH speed records
• Mersenne and Fermat Numbers
• Missing a trick: Karatsuba variations
• Modular Multiplication Without Trial Division
• Multiplication algorithm in a finite field and tensor rank of the multiplication.
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• Pairing-Friendly Elliptic Curves of Prime Order
• Prime Numbers and Irreducible Polynomials
• Public Key Cryptography - PKC 2006
• RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
• Selected Areas in Cryptography
• Selected Areas in Cryptography
• Software speed records for lattice-based signatures
• Topics in computational number theory inspired by Peter L. Montgomery
• Updating key size estimations for pairings

Cited in

(1)

• scientific article; zbMATH DE number 1424173 (Why is no real title available?)

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

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