The following pages link to (Q3997944):
Displaying 20 items.
- A general construction for monoid-based knapsack protocols (Q476358) (← links)
- Language-theoretic problems arising from Richelieu cryptosystems (Q685369) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- A method for distorting the frequency of character occurrence in the simple substitution cipher (Q954217) (← links)
- Bounded delay L codes (Q1178694) (← links)
- An RSA based public-key cryptosystem for secure communication (Q1200033) (← links)
- Was ist zero-knowledge? (Q1312706) (← links)
- A class of coders based on gsm (Q1323360) (← links)
- On a conjecture about slender context-free languages (Q1334679) (← links)
- Conducting secret ballot elections in computer networks: Problems and solutions (Q1339204) (← links)
- Input-trees of finite automata and application to cryptanalysis (Q1581120) (← links)
- The multi-dimension RSA and its low exponent security (Q1589779) (← links)
- To the distortion of the frequency of occurrence of characters in a simple substitution code (Q1760921) (← links)
- Breaking DES using P systems. (Q1874407) (← links)
- Pitfalls in public key cryptosystems based on free partially commutative monoids and groups (Q2371104) (← links)
- Computational Number Theory and Cryptography (Q2926150) (← links)
- Computational Number Theory and Modern Cryptography (Q3145109) (← links)
- Caractérisation results about $L$ codes (Q4012673) (← links)
- Break Finite Automata Public Key Cryptosystem (Q4645174) (← links)
- A fair and efficient solution to the socialist millionaires' problem (Q5939234) (← links)
