How to break Okamoto's cryptosystem by reducing lattice bases
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Lower bounds for the linear complexity of sequences over residue rings
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to predict congruential generators
CRYPTO '89 Proceedings on Advances in cryptology
Design of practical and provably good random number generators
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security
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
Lattice Basis Reduction with Dynamic Approximation
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption Schemes
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Two Faces of Lattices in Cryptology
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
A generator of pseudo-random numbers sequences with maximum period
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Designs, Codes and Cryptography
Reconstructing noisy polynomial evaluation in residue rings
Journal of Algorithms
Quantum period reconstruction of approximate sequences
Information Processing Letters
Designs, Codes and Cryptography
Secret linear congruential generators are not cryptographically secure
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On binary sequences from recursions "modulo 2e" made non-linear by the bit-by-bit "XOR" function
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Extended hidden number problem and its cryptanalytic applications
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
On stern's attack against secret truncated linear congruential generators
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
A generator of pseudo-random numbers sequences with a very long period
Mathematical and Computer Modelling: An International Journal
On pseudorandom numbers from multivariate polynomial systems
Finite Fields and Their Applications
Predicting masked linear pseudorandom number generators over finite fields
Designs, Codes and Cryptography
| Hi-index | 0.00 |