Mathematical problems in cryptology
From MaRDI portal
Publication:1910812
DOI10.1007/BF01096271zbMath0851.94017MaRDI QIDQ1910812
Publication date: 23 April 1996
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
surveyDESbibliographycryptographypseudorandom generatorszero-knowledge proofscryptographic protocolspublic key cryptographyone-way functionsdata encryption standardRSA system
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Uses Software
Cites Work
- A Mathematical Theory of Communication
- Probabilistic encryption
- Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
- Modern factorization methods
- Discrete logarithms in \(\mathrm{GF}(p)\)
- On one-way functions and polynomial-time isomorphisms
- On a public-key cryptosystem based on iterated morphisms and substitutions
- A D0L-T0L public key cryptosystem
- One way functions and pseudorandom generators
- A key distribution system equivalent to factoring
- A cryptanalytic observation concerning systems based on language theory
- Observations concerning a public-key cryptosystem based on iterated morphisms
- A uniform-complexity treatment of encryption and zero-knowledge
- Universal classes of hash functions
- Identity-Based Cryptosystems and Signature Schemes
- How to share a secret
- Fast evaluation of logarithms in fields of characteristic two
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
- Flipping Persuasively in Constant Time
- Cryptanalysis of short RSA secret exponents
- Security, veriflability, and universality in distributed computing
- Communication Theory of Secrecy Systems*
- The complexity of promise problems with applications to public-key cryptography
- A Probabilistic Factorization Algorithm with Quadratic Forms of Negative Discriminant
- Solving Simultaneous Modular Equations of Low Degree
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- The Notion of Security for Probabilistic Cryptosystems
- The Discrete Logarithm Hides $O(\log n)$ Bits
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Factoring with Cyclotomic Polynomials
- Absolute results concerning one-way functions and their applications
- On the security of the Merkle- Hellman cryptographic scheme (Corresp.)
- New directions in cryptography
- A cryptanalytic time-memory trade-off
- Cryptocomplexity and NP-completeness
- A modification of the RSA public-key encryption procedure (Corresp.)
- Relativized Questions Involving Probabilistic Algorithms
- Perfectly secure message transmission
- A method for obtaining digital signatures and public-key cryptosystems
- On the edge-independence number and edge-covering number for regular graphs
- The knowledge complexity of interactive proof-systems
- Subquadratic zero-knowledge
- A New Trapdoor Knapsack Public Key Cryptosystem
- M mod 3 security of RSA
- Cryptanalysis: a survey of recent results
- Factoring Polynomials Over Large Finite Fields
- A Zero-One Law for Boolean Privacy
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
