COLLISION-RESISTANT ELLIPTIC CURVE HASH FUNCTIONS
First Claim
Patent Images
1. A computer-implemented method for generating a cryptographic hash H of a message M, said method comprising:
- a cryptographic unit obtaining said message M;
said cryptographic unit dividing said message M into a plurality of blocks;
said cryptographic unit indexing each block;
said cryptographic unit mapping each block into a group to provide a plurality of group elements; and
said cryptographic unit combining said group elements to provide an output for representing said hash H of said message M.
7 Assignments
0 Petitions
Accused Products
Abstract
Elliptic curve hash functions are provided which do not require a pre-existing hash function, such as that required by the MuHash. The elliptic curve hash functions can be built from scratch and are collision free and can be incremental. In one embodiment, rather than a pre-existing hash function, the identity function with padding is used; and in another embodiment, rather than a pre-existing hash function, a block cipher with a fixed non-secret key is used.
-
Citations
25 Claims
-
1. A computer-implemented method for generating a cryptographic hash H of a message M, said method comprising:
-
a cryptographic unit obtaining said message M; said cryptographic unit dividing said message M into a plurality of blocks; said cryptographic unit indexing each block; said cryptographic unit mapping each block into a group to provide a plurality of group elements; and said cryptographic unit combining said group elements to provide an output for representing said hash H of said message M. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
-
13. A computer readable medium comprising computer executable instructions for generating a cryptographic hash H of a message M, said computer readable medium comprising instructions for:
-
obtaining said message M; dividing said message M into a plurality of blocks; indexing each block; mapping each block into a group to provide a plurality of group elements; and combining said group elements to provide an output for representing said hash H of said message M. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
-
-
25. A cryptographic unit for generating a cryptographic hash H of a message M, said cryptographic unit being configured for:
-
obtaining said message M; dividing said message M into a plurality of blocks; indexing each block; mapping each block into a group to provide a plurality of group elements; and combining said group elements to provide an output for representing said hash H of said message M.
-
Specification