Characterizing the existence of one-way permutations (Q1575721): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Compression and Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy sets and hard certificate schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the existence of one-way permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of one-way functions in complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative complexity of checking and evaluating / rank
 
Normal rank

Latest revision as of 12:14, 30 May 2024

scientific article
Language Label Description Also known as
English
Characterizing the existence of one-way permutations
scientific article

    Statements

    Characterizing the existence of one-way permutations (English)
    0 references
    21 August 2000
    0 references
    one-way permutations
    0 references
    one-way functions
    0 references
    ranking
    0 references
    worst-case cryptography
    0 references
    computational complexity
    0 references
    0 references
    0 references

    Identifiers