Reed-Muller Realization of X (mod P)
Danila Gorodecky
TL;DR
This paper introduces a new Reed-Muller polynomial-based method for realizing modular functions X (mod P), offering advantages in processing speed and applicability to arbitrary P, with demonstrated competitive performance.
Contribution
It presents a novel Reed-Muller polynomial expansion technique for modular realization, enabling realization for any P and improving processing speed.
Findings
Effective realization of X (mod P) for arbitrary P
Competitive speed compared to existing methods
Successful demonstration with P=7 and X [9:1]
Abstract
This article provides a novel technique of X (mod P) realization. It is based on the Reed-Muller polynomial expansion. The advantage of the approach concludes in the capability to realize X (mod P) for an arbitrary P. The approach is competitive with the known realizations on the speed processing. Advantages and results of comparison with the known approaches for X [9:1] and P=7 is demonstrated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Coding theory and cryptography · Cryptographic Implementations and Security