The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Johan T. Håstad / rank
Normal rank
 
Property / author
 
Property / author: Johan T. Håstad / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56959146 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Unpredictable Pseudo-Random Number Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Differences between Consecutive Primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient cryptographic schemes provably as secure as subset sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5751927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Factoring Based on Partial Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279590 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:40, 22 May 2024

scientific article
Language Label Description Also known as
English
The discrete logarithm modulo a composite hides \(O(n)\) bits
scientific article

    Statements

    The discrete logarithm modulo a composite hides \(O(n)\) bits (English)
    0 references
    0 references
    0 references
    0 references
    30 June 1994
    0 references
    one-way function
    0 references
    Blum integer
    0 references
    efficient pseudorandom bit generators
    0 references
    multibit commitment schemes
    0 references
    probability distributions
    0 references

    Identifiers