The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Random knapsack in expected polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic analysis of knapsack core algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Random knapsack in expected polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Safer parameters for the Chor-Rivest cryptosystem
Computers & Mathematics with Applications
An improved low-density subset sum algorithm
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Basis reduction and the complexity of branch-and-bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Public-key cryptographic primitives provably as secure as subset sum
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Solving medium-density subset sum problems in expected polynomial time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Tightly-Secure signatures from lossy identification schemes
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |