Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
Finite fields
Rounding in lattices and its cryptographic applications
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Lattice Attacks on Digital Signature Schemes
Designs, Codes and Cryptography
On The Correlation Of Binary M-sequences
Designs, Codes and Cryptography
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Certificates of Recoverability with Scale Recovery Agent Security
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Lattice Reduction in Cryptology: An Update
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
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
Security of the most significant bits of the Shamir message passing scheme
Mathematics of Computation
On the hardness of the shortest vector problem
On the hardness of the shortest vector problem
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Hidden Number Problem in Extension Fields and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
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 Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
On the hardness of approximating the permanent of structured matrices
Computational Complexity
Bits Security of the Elliptic Curve Diffie---Hellman Secret Keys
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
On the bits of elliptic curve Diffie-Hellman Keys
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Fast irreducibility testing for XTR using a gaussian normal basis of low complexity
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Improved zero value attack on XTR
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Security of polynomial transformations of the Diffie-Hellman key
Finite Fields and Their Applications
| Hi-index | 0.00 |
We consider a certain generalisation of the hidden number problem which has recently been introduced by Boneh and Venkatesan. We apply our results to study the bit security of the XTR cryptosystem and obtain some analogues of the results which have been known for the bit security of the Diffie-Hellman scheme.