Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Fast_Syndrome_Based_Hash> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Fast_Syndrome_Based_Hash abstract "In cryptography, the Fast Syndrome-based hash Functions (FSB) are a family of cryptographic hash functions introduced in 2003 by Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier.Unlike most other cryptographic hash functions in use today, FSB can to a certain extent be proven to be secure. More exactly, it can be proven that breaking FSB is at least as difficult as solving a certain NP-complete problem known as Regular Syndrome Decoding so FSB is provably secure. Though it is not known whether NP-complete problems are solvable in polynomial time, it is often assumed that they are not.Several versions of FSB have been proposed, the latest of which was submitted to the SHA-3 cryptography competition but was rejected in the first round. Though all versions of FSB claim provable security, some preliminary versions were eventually broken. The design of the latest version of FSB has however taken this attack into account and remains secure to all currently known attacks.As usual, provably security comes at a cost. FSB is slower than traditional hash functions and uses quite a lot of memory, which makes it impractical on memory constrained environments. Furthermore, the compression function used in FSB needs a large output size to guarantee security. This last problem has been solved in recent versions by simply compressing the output by another compression function called Whirlpool. However, though the authors argue that adding this last compression does not reduce security, it makes a formal security proof impossible.".
- Fast_Syndrome_Based_Hash wikiPageExternalLink index.php?pg=fsb.
- Fast_Syndrome_Based_Hash wikiPageID "25587347".
- Fast_Syndrome_Based_Hash wikiPageRevisionID "572341780".
- Fast_Syndrome_Based_Hash derivedFrom "McEliece cryptosystem and Niederreiter cryptosystem".
- Fast_Syndrome_Based_Hash derivedTo "Improved Fast Syndrome Based Hash Function".
- Fast_Syndrome_Based_Hash designers Daniel_Augot.
- Fast_Syndrome_Based_Hash designers Matthieu_Finiasz.
- Fast_Syndrome_Based_Hash designers Nicolas_Sendrier.
- Fast_Syndrome_Based_Hash digestSize "Scalable".
- Fast_Syndrome_Based_Hash hasPhotoCollection Fast_Syndrome_Based_Hash.
- Fast_Syndrome_Based_Hash name "Fast Syndrom-based hash Function".
- Fast_Syndrome_Based_Hash publishDate "2003".
- Fast_Syndrome_Based_Hash relatedTo "Syndrom-based Hash Function".
- Fast_Syndrome_Based_Hash subject Category:Cryptographic_hash_functions.
- Fast_Syndrome_Based_Hash type Abstraction100002137.
- Fast_Syndrome_Based_Hash type CryptographicHashFunctions.
- Fast_Syndrome_Based_Hash type Function113783816.
- Fast_Syndrome_Based_Hash type MathematicalRelation113783581.
- Fast_Syndrome_Based_Hash type Relation100031921.
- Fast_Syndrome_Based_Hash comment "In cryptography, the Fast Syndrome-based hash Functions (FSB) are a family of cryptographic hash functions introduced in 2003 by Daniel Augot, Matthieu Finiasz, and Nicolas Sendrier.Unlike most other cryptographic hash functions in use today, FSB can to a certain extent be proven to be secure. More exactly, it can be proven that breaking FSB is at least as difficult as solving a certain NP-complete problem known as Regular Syndrome Decoding so FSB is provably secure.".
- Fast_Syndrome_Based_Hash label "Fast Syndrome Based Hash".
- Fast_Syndrome_Based_Hash sameAs m.09v22jz.
- Fast_Syndrome_Based_Hash sameAs Q5436992.
- Fast_Syndrome_Based_Hash sameAs Q5436992.
- Fast_Syndrome_Based_Hash sameAs Fast_Syndrome_Based_Hash.
- Fast_Syndrome_Based_Hash wasDerivedFrom Fast_Syndrome_Based_Hash?oldid=572341780.
- Fast_Syndrome_Based_Hash isPrimaryTopicOf Fast_Syndrome_Based_Hash.