mod m Reduction


Please sign in to view the rest of this entry.

mod m Reduction
1010608mod m ReductionArithmetic operations over the finite ring Z m = {0, 1, … , m − 1} are used as computation primitives for executing numerous cryptographic algorithms, especially those related with the use of public keys (asymmetric cryptography). Classical examples are ciphering/deciphering, authentication, and digital signature protocols based on RSA-type or elliptic-curve algorithms. One of the basic operations is the modulo m reduction. Given two naturals x and
Citation
Jean-Pierre Deschamps; José Luis Imaña; Gustavo D. Sutter: Hardware Implementation of Finite-Field Arithmetic. mod m Reduction, Chapter (McGraw-Hill Professional, 2009), AccessEngineering Export