On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On polynomial approximation to the shortest lattice vector length
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM SIGACT News
Improved cryptographic hash functions with worst-case/average-case connection
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Designs, Codes and Cryptography
On the Security of the Digital Signature Algorithm
Designs, Codes and Cryptography
Random lattices, threshold phenomena and efficient reduction algorithms
Theoretical Computer Science
On the Generalised Hidden Number Problem and Bit Security of XTR
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Lattice Reduction by Random Sampling and Birthday Methods
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
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
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Analysis and Improvements of NTRU Encryption Paddings
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
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
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
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
A Lattice Based Public Key Cryptosystem Using Polynomial Representations
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Chinese Remaindering for Algebraic Numbers in a Hidden Field
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Segment LLL-Reduction of Lattice Bases
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Dimension Reduction Methods for Convolution Modular Lattices
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Approximate Integer Common Divisors
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Segment LLL-Reduction with Floating Point Orthogonalization
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Low Secret Exponent RSA Revisited
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Shortest Vector Problem in Lattices with Many Cycles
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Non-standard approaches to integer programming
Discrete Applied Mathematics
The optimal LLL algorithm is still polynomial in fixed dimension
Theoretical Computer Science - Latin American theoretical informatics
Security of the most significant bits of the Shamir message passing scheme
Mathematics of Computation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
Mathematics of Computation
A Measure for the Non-Orthogonality of a Lattice Basis
Combinatorics, Probability and Computing
Polynomial interpolation from multiples
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Noisy Chinese remaindering in the Lee norm
Journal of Complexity - Special issue on coding and cryptography
Representing hard lattices with O(n log n) bits
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
ACM Transactions on Algorithms (TALG)
Journal of the ACM (JACM)
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast LLL-type lattice reduction
Information and Computation
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
Reconstructing noisy polynomial evaluation in residue rings
Journal of Algorithms
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lattices that admit logarithmic worst-case to average-case connection factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Foundations and Trends® in Theoretical Computer Science
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Computational Complexity
Efficient reductions among lattice problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Finding short lattice vectors within mordell's inequality
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Limits on the Hardness of Lattice Problems in lp Norms
Computational Complexity
Algebraic Cryptanalysis of CTRU Cryptosystem
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Efficient lattice-based signature scheme
International Journal of Applied Cryptography
Explicit Hard Instances of the Shortest Vector Problem
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Rigorous and Efficient Short Lattice Vectors Enumeration
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Sampling methods for shortest vectors, closest vectors and successive minima
Theoretical Computer Science
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
Low-dimensional lattice basis reduction revisited
ACM Transactions on Algorithms (TALG)
Efficient Public Key Encryption Based on Ideal Lattices
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fast LLL-type lattice reduction
Information and Computation
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
An improved low-density subset sum algorithm
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Factoring integers and computing discrete logarithms via diophantine approximation
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
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
Cryptanalysis of the Paeng-Jung-Ha cryptosystem from PKC 2003
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
On routing in circulant graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Hypercubic lattice reduction and analysis of GGH and NTRU signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Improved analysis of Kannan's shortest lattice vector algorithm
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
A digital signature scheme based on CV P∞
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Proceedings of the forty-second ACM symposium on Theory of computing
Faster exponential time algorithms for the shortest vector problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Accelerating lattice reduction with FPGAs
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
An improvement of key generation algorithm for Gentry's homomorphic encryption scheme
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Analysis of gauss-sieve for solving the shortest vector problem in lattices
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Lattice reduction algorithms: theory and practice
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Making NTRU as secure as worst-case problems over ideal lattices
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
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
Algorithms for the shortest and closest lattice vector problems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Analyzing blockwise lattice algorithms using dynamical systems
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Approximating the closest vector problem using an approximate shortest vector oracle
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Dynamic threshold and cheater resistance for shamir secret sharing scheme
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Generalized compact knapsacks are collision resistant
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On stern's attack against secret truncated linear congruential generators
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
On the modular inversion hidden number problem
Journal of Symbolic Computation
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
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
Rankin's constant and blockwise lattice reduction
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Symplectic lattice reduction and NTRU
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Practical modifications of leadbitter et al.'s repeated-bits side-channel analysis on (EC)DSA
WISA'05 Proceedings of the 6th international conference on Information Security Applications
BKZ 2.0: better lattice security estimates
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
2log1-ε n hardness for the closest vector problem with preprocessing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Pseudorandom functions and lattices
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Column basis reduction and decomposable knapsack problems
Discrete Optimization
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
Functional encryption for threshold functions (or fuzzy IBE) from lattices
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient multiplication over extension fields
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Sampling methods for shortest vectors, closest vectors and successive minima
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Lattice-based FHE as secure as PKE
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 5.24 |