Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Very_smooth_hash> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Very_smooth_hash abstract "In cryptography, Very Smooth Hash (VSH) is a provably secure cryptographic hash function invented in 2005 by Scott Contini, Arjen Lenstra and Ron Steinfeld.Provably secure means that finding collisions is as difficult as some known hard mathematical problem. Unlike other provably secure collision-resistant hashes, VSH is efficient and usable in practice. Asymptotically, it only requires a single multiplication per log(n) message-bits and uses RSA-type arithmetic. Therefore, VSH can be useful in embedded environments where code space is limited.Two major variants of VSH were proposed. For one finding a collision is provably as difficult as finding a nontrivial modular square root of a very smooth number modulo n. The other one uses a prime modulus p (with no trapdoor), and its security proof relies on the hardness of finding discrete logarithms of very smooth numbers modulo p. Both versions have similar efficiency.VSH is not suitable as a substitute for a random oracle, but can be used to build a provably secure randomized trapdoor hash function. This function can replace the trapdoor function used in the Cramer-Shoup signature scheme, maintaining its provable security while speeding up verification time by about 50%.".
- Very_smooth_hash wikiPageID "24892363".
- Very_smooth_hash wikiPageRevisionID "577810663".
- Very_smooth_hash derivedTo "VSH*".
- Very_smooth_hash designers Arjen_Lenstra.
- Very_smooth_hash designers Ron_Steinfeld.
- Very_smooth_hash designers Scott_Contini.
- Very_smooth_hash digestSize "1024".
- Very_smooth_hash hasPhotoCollection Very_smooth_hash.
- Very_smooth_hash name "Very Smooth Hash".
- Very_smooth_hash publishDate "2005".
- Very_smooth_hash subject Category:Cryptographic_hash_functions.
- Very_smooth_hash type Abstraction100002137.
- Very_smooth_hash type CryptographicHashFunctions.
- Very_smooth_hash type Function113783816.
- Very_smooth_hash type MathematicalRelation113783581.
- Very_smooth_hash type Relation100031921.
- Very_smooth_hash comment "In cryptography, Very Smooth Hash (VSH) is a provably secure cryptographic hash function invented in 2005 by Scott Contini, Arjen Lenstra and Ron Steinfeld.Provably secure means that finding collisions is as difficult as some known hard mathematical problem. Unlike other provably secure collision-resistant hashes, VSH is efficient and usable in practice. Asymptotically, it only requires a single multiplication per log(n) message-bits and uses RSA-type arithmetic.".
- Very_smooth_hash label "VSH".
- Very_smooth_hash label "Very smooth hash".
- Very_smooth_hash sameAs VSH.
- Very_smooth_hash sameAs m.09gq4qg.
- Very_smooth_hash sameAs Q3553011.
- Very_smooth_hash sameAs Q3553011.
- Very_smooth_hash sameAs Very_smooth_hash.
- Very_smooth_hash wasDerivedFrom Very_smooth_hash?oldid=577810663.
- Very_smooth_hash isPrimaryTopicOf Very_smooth_hash.