How to break Okamoto's cryptosystem by reducing lattice bases
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Computation of approximate L-th roots modulo n and application to cryptography
CRYPTO '88 Proceedings on Advances in cryptology
Paillier's cryptosystem revisited
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On the Security of the Digital Signature Algorithm
Designs, Codes and Cryptography
Group Signatures and Their Relevance to Privacy-Protecting Off-Line Electronic Cash Systems
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
The Effectiveness of Lattice Attacks Against Low-Exponent RSA
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Finding a small root of a univariate modular equation
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Finding a small root of a bivariate integer equation; factoring with high bits known
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Why provable security matters?
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Simplified high-speed high-distance list decoding for alternant codes
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Hi-index | 0.00 |