Memoryless near-collisions via coding theory (Q663464): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-011-9484-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036606969 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q22036712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random codes: minimum distances and error exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Monte Carlo factorization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amplifying Collision Resistance: A Complexity-Theoretic Treatment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Hash Functions for Approximate Matches on the $n$-Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the covering radius of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Distributions Related to Random Mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Free-Start Collisions and Collisions for TIB3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle detection using a stack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo Methods for Index Computation (mod p) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of the Van Wee bound for binary linear covering codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel collision search with cryptanalytic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved sphere bounds on the covering radius of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Break MD5 and Other Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Collisions in the Full SHA-1 / rank
 
Normal rank

Latest revision as of 22:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Memoryless near-collisions via coding theory
scientific article

    Statements

    Memoryless near-collisions via coding theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 February 2012
    0 references
    hash functions
    0 references
    near-collisions
    0 references
    cycle finding algorithms
    0 references
    covering codes
    0 references

    Identifiers