Pages that link to "Item:Q4037444"

The following pages link to Advances in Cryptology — EUROCRYPT ’91 (Q4037444):

Displayed 36 items.

• Differential Cryptanalysis of Feal and N-Hash (Q4037445) ‎ (← links)
• Markov Ciphers and Differential Cryptanalysis (Q4037447) ‎ (← links)
• The Knapsack Hash Function proposed at Crypto’89 can be broken (Q4037448) ‎ (← links)
• An Improved Low-Density Subset Sum Algorithm (Q4037449) ‎ (← links)
• Cryptanalysis of McEliece’s Public-Key Cryptosystem (Q4037451) ‎ (← links)
• On the Security of the Schnorr Scheme using Preprocessing (Q4037452) ‎ (← links)
• Broadcast Interactive Proofs (Q4037453) ‎ (← links)
• Direct Zero Knowledge Proofs of Computational Power in Five Rounds (Q4037454) ‎ (← links)
• On the Reversibility of Oblivious Transfer (Q4037455) ‎ (← links)
• Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application (Q4037456) ‎ (← links)
• A Secret Key Cryptosystem by Iterating a Chaotic Map (Q4037459) ‎ (← links)
• Boolean Functions Satisfying Higher Order Propagation Criteria (Q4037460) ‎ (← links)
• The Maximum Order Complexity of Sequence Ensembles (Q4037461) ‎ (← links)
• The Number of Output Sequences of a Binary Sequence Generator (Q4037462) ‎ (← links)
• Linear Complexity of Periodically Repeated Random Sequences (Q4037463) ‎ (← links)
• On A Fast Correlation Attack on Certain Stream Ciphers (Q4037464) ‎ (← links)
• Analysis of Pseudo Random Sequences Generated by Cellular Automata (Q4037465) ‎ (← links)
• On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function (Q4037466) ‎ (← links)
• Weaknesses of Undeniable Signature Schemes (Q4037467) ‎ (← links)
• Distributed Provers with Applications to Undeniable Signatures (Q4037468) ‎ (← links)
• Interactive Bi-Proof Systems and Undeniable Signature Schemes (Q4037469) ‎ (← links)
• Group Signatures (Q4037470) ‎ (← links)
• Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects (Q4037471) ‎ (← links)
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation (Q4037472) ‎ (← links)
• Some Considerations concerning the Selection of RSA Moduli (Q4037473) ‎ (← links)
• On the Use of Interconnection Networks in Cryptography (Q4037475) ‎ (← links)
• Non Supersingular Elliptic Curves for Public Key Cryptosystems (Q4037476) ‎ (← links)
• Building Cyclic Elliptic Curves Modulo Large Primes (Q4037477) ‎ (← links)
• On the Complexity of Hyperelliptic Discrete Logarithm Problem (Q4037478) ‎ (← links)
• An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks (Q4037480) ‎ (← links)
• Enumerating Nondegenerate Permutations (Q4037481) ‎ (← links)
• Perfect nonlinear S-boxes (Q4037482) ‎ (← links)
• A Formal Approach to Security Architectures (Q4037483) ‎ (← links)
• Discrete Logarithm Based Protocols (Q4037484) ‎ (← links)
• Human Identification Through Insecure Channel (Q4037485) ‎ (← links)
• Dickson Pseudoprimes and Primality Testing (Q4037495) ‎ (← links)