Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3553011> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Q3553011 subject Q6109049.
- Q3553011 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%.".
- Q3553011 wikiPageWikiLink Q1052621.
- Q3553011 wikiPageWikiLink Q1138784.
- Q3553011 wikiPageWikiLink Q1563053.
- Q3553011 wikiPageWikiLink Q1766279.
- Q3553011 wikiPageWikiLink Q1779448.
- Q3553011 wikiPageWikiLink Q181551.
- Q3553011 wikiPageWikiLink Q228184.
- Q3553011 wikiPageWikiLink Q269878.
- Q3553011 wikiPageWikiLink Q333464.
- Q3553011 wikiPageWikiLink Q477202.
- Q3553011 wikiPageWikiLink Q4846249.
- Q3553011 wikiPageWikiLink Q6109049.
- Q3553011 wikiPageWikiLink Q627620.
- Q3553011 wikiPageWikiLink Q671213.
- Q3553011 wikiPageWikiLink Q7252276.
- Q3553011 wikiPageWikiLink Q836088.
- Q3553011 wikiPageWikiLink Q840661.
- Q3553011 wikiPageWikiLink Q864003.
- Q3553011 wikiPageWikiLink Q878259.
- Q3553011 wikiPageWikiLink Q8789.
- Q3553011 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.".
- Q3553011 label "Very smooth hash".