The following pages link to (Q2786507):
Displaying 50 items.
- Cryptology and Complexity Theories (Q2786508) (← links)
- A Prototype Encryption System Using Public Key (Q2974475) (← links)
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms (Q2974477) (← links)
- Identity-Based Cryptosystems and Signature Schemes (Q2974478) (← links)
- The History of Book Ciphers (Q2974480) (← links)
- An LSI Digital Encryption Processor (DEP) (Q2974484) (← links)
- A Self-Synchronizing Cascaded Cipher System with Dynamic Control of Error Propagation (Q2974486) (← links)
- Security of Ramp Schemes (Q2974487) (← links)
- On the Cryptographic Applications of Random Functions (Extended Abstract) (Q2974488) (← links)
- RSA/Rabin least significant bits are $$ \tfrac{1} {2} + \tfrac{1} {{poly \left( {\log N} \right)}} $$ secure (Extended Abstract) (Q2974489) (← links)
- Cryptanalysis of Adfgvx Encipherment Systems (Q2974490) (← links)
- Dependence of output on input in DES: Small avalanche characteristics (Q2974491) (← links)
- Des has no Per Round Linear Factors (Q2974493) (← links)
- Fair Exchange of Secrets (extended abstract) (Q2974495) (← links)
- Cryptoprotocols: Subscription to a Public Key, The Secret Blocking and The Multi-Player Mental Poker Game (extended abstract) (Q2974496) (← links)
- A “Paradoxical” Solution to The Signature Problem (Q2974497) (← links)
- Sequence Complexity as a Test for Cryptographic Systems (Q2974499) (← links)
- An Update on Quantum Cryptography (Q2974500) (← links)
- How to Keep a Secret Alive (Q2974501) (← links)
- On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem (Q3332924) (← links)
- On the Security of Ping-Pong Protocols (Q3661462) (← links)
- Fast Computation of Discrete Logarithms in GF (q) (Q3661465) (← links)
- Security of a Keystream Cipher with Secret Initial Value (Q3661467) (← links)
- A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem (Q3664979) (← links)
- A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft) (Q3689091) (← links)
- Authentication Theory/Coding Theory (Q3695175) (← links)
- Equivocations for Homophonic Ciphers (Q3728802) (← links)
- On the Use of the Binary Multiplying Channel in a Private Communication System (Q3728803) (← links)
- Linear Ciphers and Random Sequence Generators with Multiple Clocks (Q3728804) (← links)
- RSA-bits are 0.5 + ε secure (Q3728805) (← links)
- Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme (Q3728806) (← links)
- Propagation Characteristics of the DES (Q3728807) (← links)
- Time-Division Multiplexing Scramblers: Selecting Permutations and Testing the System (Q3728808) (← links)
- Algebraical Structures of Cryptographic Transformations (Q3728809) (← links)
- Strong Primes are Easy to Find (Q3728811) (← links)
- On Cryptosystems Based on Polynomials and Finite Fields (Q3728812) (← links)
- Some Public-Key Crypto-Functions as Intractable as Factorization (Q3739049) (← links)
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information (Q3739050) (← links)
- Non Linear Non Commutative Functions for Data Integrity (Q4576805) (← links)
- A New Trapdoor Knapsack Public Key Cryptosystem (Q4576807) (← links)
- RSA Chips (Past/Present/Future) (Extended abstract) (Q4576808) (← links)
- Knapsack Public Key Cryptosystems and Diophantine Approximation (Q5019314) (← links)
- Solving Low Density Knapsacks (Q5019315) (← links)
- Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems (Q5019316) (← links)
- On the Power of Cascade Ciphers (Q5019317) (← links)
- The Prisoners’ Problem and the Subliminal Channel (Q5019318) (← links)
- An Overview of Factoring (Q5019319) (← links)
- New Ideas for Factoring Large Integers (Q5019320) (← links)
- Factoring Numbers on the Massively Parallel Computer (Q5019321) (← links)
- Factorization Using the Quadratic Sieve Algorithm (Q5019322) (← links)
