On polynomial modular number systems over Z/pZ

DOI10.3934/AMC.2022018MaRDI QIDQ6556574zbMATH OpenFDO

Authors Jean-Claude Bajard, Jérémy Marrez, Thomas Plantard, Pascal Véron

Publication date 17 June 2024

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2022018

zbMATH Keywords

finite fieldmodular arithmeticPolynomial Modular Number Systempolynomial roots

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Algorithms in computer science (68W99) Cryptography (94A60)

Recommendations

• Selected Areas in Cryptography
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• Selected Areas in Cryptography
• PMNS for cryptography: a guided tour
• On the polynomial residue number system (digital signal processing)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Algorithms for the shortest and closest lattice vector problems
• An alternative approach for SIDH arithmetic
• An introduction to the geometry of numbers.
• Block Reduced Lattice Bases and Successive Minima
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• Efficient multiplication over extension fields
• Elliptic Curve Cryptosystems
• Factoring polynomials with rational coefficients
• Fast cryptography in genus 2
• Faster integer multiplication using short lattice vectors
• Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
• scientific article; zbMATH DE number 5809457 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 3980484 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 1775383 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• scientific article; zbMATH DE number 5041222 (Why is no real title available?)
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
• Mathematics of public key cryptography.
• Modular Multiplication Without Trial Division
• On Lovász' lattice reduction and the nearest lattice point problem
• On quadratic forms.
• On the Irreducibility of Certain Trinomials and Quadrinomials.
• Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
• Schönemann-Eisenstein-Dumas-type irreducibility conditions that use arbitrarily many prime numbers
• Sur quelques cas d'irréductibilité des polynomes à coefficients rationnels.
• The factorization of certain quadrinominals.

Cited in

(3)

• PMNS for cryptography: a guided tour
• Equality tests in the polynomial modular number system
• On the feasibility of 256-bit prime field arithmetic via PMNS on 8-bit architectures

This page was built for publication: On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)

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