arXiv (All)
open access
Faster PMNS Multi-precision Multiplications Using Truncated Montgomery Technique
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 im
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Faster PMNS Multi-precision Multiplications Using Truncated Montgomery Technique#1227259
- Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes#644394
- Adelic reduction of module lattices#1117648
- Generic Characteristic-Zero Equivalence Between Derivative Bézout Inversion and Multipoint Evaluation#1011311
- Compressed Inverse Suffix Arrays#924621
Record · ID 1234134
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive