A SIMPLE TECHNIQUE FOR IMPLEMENTING A CRYPTOGRAPHIC PRIMITIVE USING ELEMENTARY REGISTER OPERATIONS

摘要

A technique which implements a primitive for computing, e.g., a checksum. Specifically, this primitive replaces a mod (M) operation with a series of operation including mod 2n multiplications, order manipulations (620) and (660), and additions -- all of which are extremely simple to implement and require very few processing cycles to execute. Hence, use of our inventive technique can significantly reduce the processing time to compute various cryptographic parameters, such as, e.g., a message authentication code (400), or to implement a stream cipher (23), over that conventionally required. This technique has both invertible and non-invertible variants.