Metraipolis › archive › dc_f019342fd946

Faster PMNS Multi-precision Multiplications Using Truncated Montgomery Technique — arXiv:2610.09767

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09767
License (as archived)
CC0-1.0
Archived
2026-10-08T11:44:27.149Z
SHA-256 of the archived text
a9a040321ac60d25eab1646a86b179602c32281512097e966b1afd6904bc15e1
Stable URL of this page
https://metraipolis.com/documento/dc_f019342fd946

How to cite

Faster PMNS Multi-precision Multiplications Using Truncated Montgomery Technique — arXiv:2610.09767 — arXiv (en), https://arxiv.org/abs/2610.09767 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f019342fd946 (Metraipolis archive dc_f019342fd946, sha256 a9a040321ac60d25eab1646a86b179602c32281512097e966b1afd6904bc15e1)
BibTeX
@misc{dcf019342fd946,
  title = {Faster PMNS Multi-precision Multiplications Using Truncated Montgomery Technique — arXiv:2610.09767},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09767},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f019342fd946; sha256 a9a040321ac60d25eab1646a86b179602c32281512097e966b1afd6904bc15e1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09767. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Polynomial Modular Number Systems (PMNS) aim to represent elements of fields or rings of large characteristics using polynomials satisfying bounds on some parameters (degree, absolute values of the coefficients). Those PMNS, while some conditions are fulfilled, using convenient parameters and implementation features, allow some speed-ups in cryptographic computations. Recent works (Meloni \emph{et al.} \cite{MeloniPV25}) propose better speed-ups by improving the parameter generation of the system, and by using multi-precision polynomial coefficients, i.e. coefficients stored using several machine words. In this work, we first present PMNS schoolbook software implementation better in some context than the Toeplitz state-of-the-art counterpart of \cite{MeloniPV25}, taking advantage of smaller memory cost by being free to choose a smaller $n$ parameter, minimizing at the same time the complexity of the multiplication. This implementation for 4096 bit modulo size shows element size smaller by 11\% and 20 \% speed-up. We thus present a new improvement on the PMNS, applying to the \textsl{internal reduction} an approach similar to the truncated Montgomery reduction technique presented by Didier \emph{et al.} in \cite{DidierEGR24}. In the context of software implementations using \texttt{AVX512} instruction set extension, and modulo size up to 8192 bits, this new approach allows speed-ups up to 15\% in modular multiplication computation, in comparison with conventional approaches.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2610.09767 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T10:45:22.454Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).