The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Designs, Codes and Cryptography
Designs, Codes and Cryptography
Quantum period reconstruction of approximate sequences
Information Processing Letters
Classical and Quantum Algorithms for Exponential Congruences
Theory of Quantum Computation, Communication, and Cryptography
Optimal Randomness Extraction from a Diffie-Hellman Element
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Pseudorandom graphs from elliptic curves
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Deterministic encoding and hashing to odd hyperelliptic curves
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
An algorithm for computing a basis of a finite abelian group
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
On randomness extraction in elliptic curves
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Quantum period reconstruction of binary sequences
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Construction of pseudo-random binary sequences from elliptic curves by using discrete logarithm
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Constructions of approximately mutually unbiased bases
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
International Journal of Applied Cryptography
Remarks on Pseudorandom Binary Sequences Over Elliptic Curves
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
| Hi-index | 0.00 |