Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Elliptic_curve_only_hash> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Elliptic_curve_only_hash abstract "The elliptic curve only hash (ECOH) algorithm was submitted as a candidate for SHA-3 in the NIST hash function competition. However, it was rejected in the beginning of the competition since a second pre-image attack was found. The ECOH is based on the MuHASH hash algorithm, that has not yet been successfully attacked. However, MuHASH is too inefficient for practical use and changes had to be made. The main difference is that where MuHASH applies a random oracle, ECOH applies a padding function. Assuming random oracles, finding a collision in MuHASH implies solving the discrete logarithm problem. MuHASH is thus a provably secure hash, i.e. we know that finding a collision is at least as hard as some hard known mathematical problem. ECOH does not use random oracles and its security is not strictly directly related to the discrete logarithm problem, yet it is still based on mathematical functions. ECOH is related to the Semaev's problem of finding low degree solutions to the summation polynomial equations over binary field, called the Summation Polynomial Problem. An efficient algorithm to solve this problem has not been given so far. Although the problem was not proven to be NP-hard, it is assumed that such an algorithm does not exist. Under certain assumptions, finding a collision in ECOH may be also viewed as an instance of the subset sum problem. Besides solving the Summation Polynomial Problem, there exists another way how to find second pre-images and thus collisions, Wagner's generalized birthday attack. ECOH is a nice example of hash function that is based on mathematical functions (with the provable security approach) rather than on classical ad hoc mixing of bits to obtain the hash.".
- Elliptic_curve_only_hash wikiPageExternalLink ECOH_Comments.pdf.
- Elliptic_curve_only_hash wikiPageExternalLink Ecoh.pdf.
- Elliptic_curve_only_hash wikiPageExternalLink 168.pdf.
- Elliptic_curve_only_hash wikiPageID "25693976".
- Elliptic_curve_only_hash wikiPageRevisionID "568298171".
- Elliptic_curve_only_hash cryptanalysis "Second Pre-Image".
- Elliptic_curve_only_hash derivedFrom MuHASH.
- Elliptic_curve_only_hash designers "Daniel R. L. Brown, Matt Campagna, Rene Struik".
- Elliptic_curve_only_hash digestSize "224256384".
- Elliptic_curve_only_hash hasPhotoCollection Elliptic_curve_only_hash.
- Elliptic_curve_only_hash name "Elliptic curve only hash".
- Elliptic_curve_only_hash publishDate "2008".
- Elliptic_curve_only_hash subject Category:Cryptographic_hash_functions.
- Elliptic_curve_only_hash type Abstraction100002137.
- Elliptic_curve_only_hash type CryptographicHashFunctions.
- Elliptic_curve_only_hash type Function113783816.
- Elliptic_curve_only_hash type MathematicalRelation113783581.
- Elliptic_curve_only_hash type Relation100031921.
- Elliptic_curve_only_hash comment "The elliptic curve only hash (ECOH) algorithm was submitted as a candidate for SHA-3 in the NIST hash function competition. However, it was rejected in the beginning of the competition since a second pre-image attack was found. The ECOH is based on the MuHASH hash algorithm, that has not yet been successfully attacked. However, MuHASH is too inefficient for practical use and changes had to be made.".
- Elliptic_curve_only_hash label "Elliptic curve only hash".
- Elliptic_curve_only_hash sameAs m.0b6d0gt.
- Elliptic_curve_only_hash sameAs Q5365792.
- Elliptic_curve_only_hash sameAs Q5365792.
- Elliptic_curve_only_hash sameAs Elliptic_curve_only_hash.
- Elliptic_curve_only_hash wasDerivedFrom Elliptic_curve_only_hash?oldid=568298171.
- Elliptic_curve_only_hash isPrimaryTopicOf Elliptic_curve_only_hash.