Using Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
An Improved Pseudo-random Generator Based on Discrete Log
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
All Bits ax+b mod p are Hard (Extended Abstract)
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
The Bit Security of Paillier's Encryption Scheme and Its Applications
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
The security of all RSA and discrete log bits
Journal of the ACM (JACM)
Computational Complexity
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
Efficient Two-Party Secure Computation on Committed Inputs
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
A New Hard-Core Predicate of Paillier's Trapdoor Function
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
An efficient pseudo-random generator provably as secure as syndrome decoding
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Stronger security proofs for RSA and rabin bits
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Rapid demonstration of linear relations connected by boolean operators
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
An improved pseudorandom generator based on hardness of factoring
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Cryptographic extraction and key derivation: the HKDF scheme
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Okamoto-Tanaka revisited: fully authenticated diffie-hellman with minimal overhead
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Hard bits of the discrete log with applications to password authentication
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient primitives from exponentiation in Zp
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
An efficient static blind ring signature scheme
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
| Hi-index | 0.00 |