A course in number theory and cryptography
A course in number theory and cryptography
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Relationships among the computational powers of breaking discrete log cryptosystems
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Security of most significant bits of gx2
Information Processing Letters
On the Generalised Hidden Number Problem and Bit Security of XTR
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The Hidden Number Problem in Extension Fields and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
Mathematics of Computation
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Designs, Codes and Cryptography
Polynomial interpolation from multiples
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the hardness of approximating the permanent of structured matrices
Computational Complexity
On the complexity of the discrete logarithm and Diffie-Hellman problems
Journal of Complexity - Special issue on coding and cryptography
Noisy Chinese remaindering in the Lee norm
Journal of Complexity - Special issue on coding and cryptography
DSA Signature Scheme Immune to the Fault Cryptanalysis
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
The complexity of unions of disjoint sets
Journal of Computer and System Sciences
Theoretical Computer Science
The complexity of unions of disjoint sets
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On the bits of elliptic curve Diffie-Hellman Keys
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Hardness of distinguishing the MSB or LSB of secret keys in diffie-hellman schemes
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On the modular inversion hidden number problem
Journal of Symbolic Computation
Hi-index | 0.00 |