RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
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
Analysis and Improvements of NTRU Encryption Paddings
CRYPTO '02 Proceedings of the 22nd 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
Key Recovery and Message Attacks on NTRU-Composite
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Security of the most significant bits of the Shamir message passing scheme
Mathematics of Computation
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
Mathematics of Computation
The security of all RSA and discrete log bits
Journal of the ACM (JACM)
Why and how to establish a private code on a public network
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Privacy-aware multi-context RFID infrastructure using public key cryptography
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Recovering NTRU secret key from inversion oracles
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Security of polynomial transformations of the Diffie-Hellman key
Finite Fields and Their Applications
| Hi-index | 0.00 |
We show that in certain natural computational models every bit of a message encrypted with the NTRUENCRYPT cryptosystem is as secure as the whole message.