PMNS for cryptography: a guided tour

DOI10.3934/AMC.2023033MaRDI QIDQ6548439FDOQ6548439

Authors: Nicolas Meloni, François Palma, Pascal Véron 

Publication date: 1 June 2024

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

Recommendations

• On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
• Implementing a multiple recursive generator with mersenne prime modulus
• Selected Areas in Cryptography
• Cunningham numbers in modular arithmetic
• Improvement of lattice-based cryptography using CRT

zbMATH Keywords

finite fieldmodular arithmeticpolynomial modular number system

Mathematics Subject Classification ID

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

Cites Work

• Modular Multiplication Without Trial Division
• Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
• Selected Areas in Cryptography
• Multiway Splitting Method for Toeplitz Matrix Vector Product
• An alternative approach for SIDH arithmetic

Cited In (2)

• On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\)
• Computation of the least primitive root

This page was built for publication: PMNS for cryptography: a guided tour

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