|
Two-Track-MAC
Two-Track-MAC algorithm has been selected as a finalist for NESSIE NESSIE (New European Schemes for Signatures, Integrity and Encryption) was a European research project funded from 2000 to 2003 to identify secure cryptographic primitives. The project was comparable to the NIST AES process and the Japanese Go ... in November 2000 and was conceived as a fast and reliable method to hash data. The development was attended by Bart of Van Rompay ( Eng. ) From the Leuven University ( Katholieke Universiteit Leuven ) - Belgium and Bert den Boer of debis AG (Germany). It uses two hash functions in parallel, making it similar to MDC-2. External links New (Two-Track-)MAC Based on the Two Trails of RIPEMD Message authentication codes {{crypto-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NESSIE
NESSIE (New European Schemes for Signatures, Integrity and Encryption) was a European research project funded from 2000 to 2003 to identify secure cryptographic primitives. The project was comparable to the NIST AES process and the Japanese Government-sponsored CRYPTREC project, but with notable differences from both. In particular, there is both overlap and disagreement between the selections and recommendations from NESSIE and CRYPTREC (as of the August 2003 draft report). The NESSIE participants include some of the foremost active cryptographers in the world, as does the CRYPTREC project. NESSIE was intended to identify and evaluate quality cryptographic designs in several categories, and to that end issued a public call for submissions in March 2000. Forty-two were received, and in February 2003 twelve of the submissions were selected. In addition, five algorithms already publicly known, but not explicitly submitted to the project, were chosen as "selectees". The project h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptographic Hash Function
A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with fixed size of n bits) that has special properties desirable for cryptography: * the probability of a particular n-bit output result ( hash value) for a random input string ("message") is 2^ (like for any good hash), so the hash value can be used as a representative of the message; * finding an input string that matches a given hash value (a ''pre-image'') is unfeasible, unless the value is selected from a known pre-calculated dictionary ("rainbow table"). The ''resistance'' to such search is quantified as security strength, a cryptographic hash with n bits of hash value is expected to have a ''preimage resistance'' strength of n bits. A ''second preimage'' resistance strength, with the same expectations, refers to a similar problem of finding a second message that matches the given hash value when one message is already known; * finding any pair of different me ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MDC-2
In cryptography, MDC-2 (Modification Detection Code 2, sometimes called Meyer–Schilling, standardized in ISO 10118-2) is a cryptographic hash function. MDC-2 is a hash function based on a block cipher with a proof of security in the ideal-cipher model. The length of the output hash depends on the underlying block cipher used. Algorithm For a given message M to hash and a given block cipher encryption function E, the MDC-2 algorithm proceeds as follows. Let n be the block length, A_1, B_1 two different constants of size n. If M = M_1, , .., , M_m where each M_i has size n, then the hash V_m, , W_m of the message is given by: *for i = 1 to m: **V_i = M_i \oplus E(M_i,A_i) **W_i = M_i \oplus E(M_i,B_i) **V_i^L , , V_i^R = V_i **W_i^L , , W_i^R = W_i **A_ = V_i^L, , W_i^R **B_ = W_i^L, , V_i^R *return A_, , B_ MDC-2DES hashes When MDC-2 uses the DES block cipher, the 128-bit (16-byte) MDC-2 hashes are typically represented as 32-digit hexadecimal numbers. A_1is chosen as the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |