Abstract:
A technique which implements a primitive for computing, e.g., checksum, this primitive replaces a mod(M) operation with a series of simple elementary register operations (20). These operations include mod 2 multiplications, order manipulations (e.g., byte or word swaps), 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 (MAC) (400), or to implement a stream cipher (23) over that conventionally required. This technique has both invertible and non-invertible variants.
Abstract:
A technique which implements a primitive for computing, e.g., a checksum. Specifically, this primitive replaces a mod(M) operation with a series of simple elementary register operations. These operations include mod 2 multiplications, order manipulations (e.g., byte or word swaps), 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 (MAC), or to implement a stream cipher, over that conventionally required. This technique has both invertible and non-invertible variants.