Reed-Muller Realization of X (mod P)
Cryptography and Security
2015-04-21 v1
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.
Cite
@article{arxiv.1504.04773,
title = {Reed-Muller Realization of X (mod P)},
author = {Danila Gorodecky},
journal= {arXiv preprint arXiv:1504.04773},
year = {2015}
}