Weakness of a public-key cryptosystem based on factorizations of finite groups
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Multi-round passive attacks on server-aided RSA protocols
Proceedings of the 7th ACM conference on Computer and communications security
Operator Learning for a Problem Class in a Distributed Peer-to-Peer Environment
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A New Identification Scheme Based on Syndrome Decoding
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
On the Insecurity of a Server-Aided RSA Protocol
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Lattice Basis Reduction with Dynamic Approximation
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Secure Server-Aided Signature Generation
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
Non-standard approaches to integer programming
Discrete Applied Mathematics
Random knapsack in expected polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Heuristics on lattice basis reduction in practice
Journal of Experimental Algorithmics (JEA)
A Measure for the Non-Orthogonality of a Lattice Basis
Combinatorics, Probability and Computing
The inapproximability of lattice and coding problems with preprocessing
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Designs, Codes and Cryptography
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
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
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Broadcast Attacks against Lattice-Based Cryptosystems
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Analysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range
Information Sciences: an International Journal
Attacking the Chor-Rivest cryptosystem by improved lattice reduction
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Noisy polynomial interpolation and noisy chinese remaindering
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Toward non-parallelizable client puzzles
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
New definition of density on knapsack cryptosystems
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
An improved multi-set algorithm for the dense subset sum problem
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Proceedings of the forty-second ACM symposium on Theory of computing
DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Improved generic algorithms for hard knapsacks
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Improving the parallel schnorr-euchner lll algorithm
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Adapting density attacks to low-weight knapsacks
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Practical lattice basis sampling reduction
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Solving medium-density subset sum problems in expected polynomial time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A public key cryptosystem based on three new provable problems
Theoretical Computer Science
New generic algorithms for hard knapsacks
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Lattice enumeration using extreme pruning
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Finite Fields and Their Applications
Lower bounds of shortest vector lengths in random NTRU lattices
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Faster algorithm for solving hard knapsacks for moderate message length
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
New attacks for knapsack based cryptosystems
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A note on BDD problems with λ2 -gap
Information Processing Letters
Outsourcing computation of modular exponentiations in cloud computing
Cluster Computing
| Hi-index | 0.00 |