Security of cryptographic hash functions (original) (raw)
In cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based on mathematical problems, and whose security thus follows from rigorous mathematical proofs, complexity theory and formal reduction. These functions are called Provably Secure Cryptographic Hash Functions. To construct these is very difficult, and few examples have been introduced. Their practical use is limited.
| Property | Value |
|---|---|
| dbo:abstract | In cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based on mathematical problems, and whose security thus follows from rigorous mathematical proofs, complexity theory and formal reduction. These functions are called Provably Secure Cryptographic Hash Functions. To construct these is very difficult, and few examples have been introduced. Their practical use is limited. In the second category are functions which are not based on mathematical problems, but on an ad-hoc constructions, in which the bits of the message are mixed to produce the hash. These are then believed to be hard to break, but no formal proof is given. Almost all hash functions in widespread use reside in this category. Some of these functions are already broken, and are no longer in use. See Hash function security summary. (en) В криптографии криптографические хеш-функции можно разделить на две основные категории. В первую категорию входят функции, основанные на математических задачах. Их безопасность следует из строгих математических доказательств, теории сложности вычислений и формального сокращения. Эти функции называются доказуемо безопасными хеш-функциями. Построить их довольно сложно, и существует немного примеров. Их практическое использование ограничено. Во вторую категорию входят функции, которые основаны не на математических задачах, а на специальных конструкциях, в которых биты сообщения смешиваются для получения хеша. Считается, что их трудно сломать, но никаких формальных доказательств не приводится. В эту категорию входят почти все широко используемые хеш-функции. Некоторые из них уже взломаны и больше не используются. (ru) |
| dbo:wikiPageID | 25645668 (xsd:integer) |
| dbo:wikiPageLength | 13440 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1084906878 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:MD5 dbr:Bitwise_operation dbr:Integer_factorization dbr:PSPACE-complete dbr:Worst-case_complexity dbr:Proof_of_knowledge dbr:MuHASH dbr:Cryptographic_hash_functions dbr:Cryptography dbr:SHA-1 dbr:Elliptic_curve_only_hash dbr:One-way_function dbr:Randomness_tests dbr:Quadratic_residue dbr:Modular_arithmetic dbr:Computational_complexity_theory dbr:Key_derivation_function dbr:Password dbr:Hash_function_security_summary dbr:Fast_Syndrome_Based_Hash dbr:Polynomial-time_reduction dbr:SWIFFT dbr:Discrete_logarithm dbr:Fast_Fourier_transform dbr:One-way_compression_function dbr:Password_cracking dbr:Reduction_(complexity) dbr:Birthday_attack dbr:Average-case_complexity dbc:Cryptographic_hash_functions dbr:Polynomial_time dbr:Ideal_lattice_cryptography dbr:Knapsack_problem dbr:Special_linear_group dbr:Subset_sum_problem dbr:Very_smooth_hash dbr:RSA_public_key_cryptography dbr:Pre-image_attack dbr:Chaum,_van_Heijst,_Pfitzmann_hash_function dbr:Hash_functions_from_Sigma_Protocols dbr:Knapsack-based_hash_functions dbr:Second_pre-image_attack dbr:The_Zémor-Tillich_hash_function |
| dbp:wikiPageUsesTemplate | dbt:Citation_needed dbt:Dubious dbt:Main_article dbt:Reflist dbt:Short_description dbt:Cryptography_navbox |
| dct:subject | dbc:Cryptographic_hash_functions |
| rdf:type | yago:WikicatCryptographicHashFunctions yago:Abstraction100002137 yago:Function113783816 yago:MathematicalRelation113783581 yago:Relation100031921 |
| rdfs:comment | In cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based on mathematical problems, and whose security thus follows from rigorous mathematical proofs, complexity theory and formal reduction. These functions are called Provably Secure Cryptographic Hash Functions. To construct these is very difficult, and few examples have been introduced. Their practical use is limited. (en) В криптографии криптографические хеш-функции можно разделить на две основные категории. В первую категорию входят функции, основанные на математических задачах. Их безопасность следует из строгих математических доказательств, теории сложности вычислений и формального сокращения. Эти функции называются доказуемо безопасными хеш-функциями. Построить их довольно сложно, и существует немного примеров. Их практическое использование ограничено. (ru) |
| rdfs:label | Security of cryptographic hash functions (en) Безопасность криптографических хеш-функций (ru) |
| owl:sameAs | freebase:Security of cryptographic hash functions yago-res:Security of cryptographic hash functions wikidata:Security of cryptographic hash functions dbpedia-ru:Security of cryptographic hash functions https://global.dbpedia.org/id/4tuJx |
| prov:wasDerivedFrom | wikipedia-en:Security_of_cryptographic_hash_functions?oldid=1084906878&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Security_of_cryptographic_hash_functions |
| is dbo:wikiPageRedirects of | dbr:Provably_secure_cryptographic_hash_function dbr:Provably_secure_hash_function |
| is dbo:wikiPageWikiLink of | dbr:Cryptographic_hash_function dbr:Provably_secure_cryptographic_hash_function dbr:Provably_secure_hash_function |
| is foaf:primaryTopic of | wikipedia-en:Security_of_cryptographic_hash_functions |