A Proof of Security in O(2 n ) for the Xor of Two Random Permutations (Q5502805): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Foiling Birthday Attacks in Length-Doubling Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem on Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of Security in O(2 n ) for the Xor of Two Random Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Attacks for the Xor of k Random Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879444 / rank
 
Normal rank

Latest revision as of 22:35, 28 June 2024

scientific article; zbMATH DE number 5488469
Language Label Description Also known as
English
A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
scientific article; zbMATH DE number 5488469

    Statements

    A Proof of Security in O(2 n ) for the Xor of Two Random Permutations (English)
    0 references
    0 references
    9 January 2009
    0 references
    pseudorandom functions
    0 references
    pseudorandom permutations
    0 references
    security beyond the birthday bound
    0 references
    Luby-Rackoff backwards
    0 references

    Identifiers