Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1998.1618 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1909955916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RSA and Rabin Functions: Certain Parts are as Hard as the Whole / rank
 
Normal rank
Property / cites work
 
Property / cites work: When won't membership queries help? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Generate Factored Random Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Depth Circuits for Division and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring / 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: Checking the correctness of memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341754 / 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: Algorithms for Black-Box Fields and their Application to Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern cryptology. A tutorial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger security proofs for RSA and Rabin bits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3775469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cryptographic Applications of Random Functions (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete logarithm modulo a composite hides \(O(n)\) bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318712 / 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: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness of distribution-specific learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A key distribution system equivalent to factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of pseudorandom permutations: Luby-Rackoff revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number-theoretic constructions of efficient pseudo-random functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness is linear in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Artin's conjecture for primitive roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Pseudorandom Number Generation / 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: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:02, 28 May 2024

scientific article
Language Label Description Also known as
English
Synthesizers and their application to the parallel construction of pseudo-random functions
scientific article

    Statements

    Synthesizers and their application to the parallel construction of pseudo-random functions (English)
    0 references
    0 references
    0 references
    11 May 1999
    0 references
    0 references
    pseudo-random function
    0 references
    encryption
    0 references
    identification
    0 references
    authentication
    0 references
    computational learning theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references