Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Use of the ‘Signature Token’ to Create a Negotiable Document: Label: en
RSA bits are .732 + ε secure: Label: en
Improving the Security of Exponential Key Exchange: Label: en
Some Results on the Information Theoretic Analysis of Cryptosystems: Label: en
Permutation Polynomials in RSA-Cryptosystems: Label: en
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2): Label: en
Probabilistic Analysis and Performance Modelling of the ‘Swedish’ Algorithm and Modifications: Label: en
Field Encryption and Authentication: Label: en
On the Security of Compressed Encodings: Label: en
Producing a One-Way Hash Function from DES: Label: en
Analytical Characteristics of the DES: Label: en
A Layered Broadcast Cryptographic System: Label: en
Blind Signature System: Label: en
How to Exchange Half a Bit: Label: en
Reducibility Among Protocols: Label: en
A Simple Protocol for Signing Contracts: Label: en
Signatures Through Approximate Representations by Quadratic Forms: Label: en
Factorization Using the Quadratic Sieve Algorithm: Label: en
Factoring Numbers on the Massively Parallel Computer: Label: en
New Ideas for Factoring Large Integers: Label: en
An Overview of Factoring: Label: en
The Prisoners’ Problem and the Subliminal Channel: Label: en
On the Power of Cascade Ciphers: Label: en
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems: Label: en
Solving Low Density Knapsacks: Label: en
Knapsack Public Key Cryptosystems and Diophantine Approximation: Label: en
RSA Chips (Past/Present/Future) (Extended abstract): Label: en
A New Trapdoor Knapsack Public Key Cryptosystem: Label: en
Non Linear Non Commutative Functions for Data Integrity: Label: en
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information: Label: en
Some Public-Key Crypto-Functions as Intractable as Factorization: Label: en
On Cryptosystems Based on Polynomials and Finite Fields: Label: en
Strong Primes are Easy to Find: Label: en
Algebraical Structures of Cryptographic Transformations: Label: en
Time-Division Multiplexing Scramblers: Selecting Permutations and Testing the System: Label: en
Propagation Characteristics of the DES: Label: en
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme: Label: en
RSA-bits are 0.5 + ε secure: Label: en
Linear Ciphers and Random Sequence Generators with Multiple Clocks: Label: en
On the Use of the Binary Multiplying Channel in a Private Communication System: Label: en
Equivocations for Homophonic Ciphers: Label: en
Wire-Tap Channel II: Label: en
Authentication Theory/Coding Theory: Label: en
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft): Label: en
Security of a Keystream Cipher with Secret Initial Value: Label: en
Fast Computation of Discrete Logarithms in GF (q): Label: en
On the Security of Ping-Pong Protocols: Label: en
A Public-Key Cryptosystem Based on the Matrix Cover NP-Complete Problem: Label: en
On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem: Label: en
How to Keep a Secret Alive: Label: en