How to break Okamoto's cryptosystem by reducing lattice bases
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Generating automatically tuned bitmaps from outlines
Journal of the ACM (JACM)
Rounding in lattices and its cryptographic applications
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Design concepts for matrices and lattices in LiDIA
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Finding the closest lattice vector when it's unusually close
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Improved cryptographic hash functions with worst-case/average-case connection
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Lattice Attacks on Digital Signature Schemes
Designs, Codes and Cryptography
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
The Complexity of the Extended GCD Problem
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Discrete/Continuous Minimization Method in Interferometric Image Processing
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
CRYPTO '01 Proceedings of the 21st 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
Tensor-Based Trapdoors for CVP and Their Application to Public Key Cryptography
Proceedings of the 7th IMA International Conference on Cryptography and Coding
Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
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
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
The optimal LLL algorithm is still polynomial in fixed dimension
Theoretical Computer Science - Latin American theoretical informatics
Fast Differential Unitary Space-Time Modulation Decoding for a MIMO Radio Channel
Wireless Personal Communications: An International Journal
Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
Mathematics of Computation
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Designs, Codes and Cryptography
Simultaneous diophantine approximation with excluded primes
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
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
Jug measuring: Algorithms and complexity
Theoretical Computer Science
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Gröbner bases for public key cryptography
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Limits on the Hardness of Lattice Problems in lp Norms
Computational Complexity
Cryptanalysis of General Lu-Lee Type Systems
Information Security and Cryptology
Exponentiation in Pairing-Friendly Groups Using Homomorphisms
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Efficient lattice-based signature scheme
International Journal of Applied Cryptography
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
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Broadcast Attacks against Lattice-Based Cryptosystems
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
On Modular Decomposition of Integers
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Low-dimensional lattice basis reduction revisited
ACM Transactions on Algorithms (TALG)
Complex lattice reduction algorithm for low-complexity full-diversity MIMO detection
IEEE Transactions on Signal Processing
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
A new transference theorem in the geometry of numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
About the XL algorithm over GF(2)
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
On further reduction of complexity in tree pruning based sphere search
IEEE Transactions on Communications
A hybrid lattice-reduction and meet-in-the-middle attack against NTRU
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Improved analysis of Kannan's shortest lattice vector algorithm
CRYPTO'07 Proceedings of the 27th annual international cryptology 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
Frequency estimation by phase unwrapping
IEEE Transactions on Signal Processing
Polynomial-phase estimation, phase unwrapping and the nearest lattice point problem
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Augmented lattice reduction for MIMO decoding
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
An efficient and parallel Gaussian sampler for lattices
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Performance and complexity analysis of infinity-norm sphere-decoding
IEEE Transactions on Information Theory
Lattice Polly Cracker cryptosystems
Journal of Symbolic Computation
Better key sizes (and attacks) for LWE-based encryption
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Journal of Global Optimization
Improving BDD cryptosystems in general lattices
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Algorithms for the shortest and closest lattice vector problems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Cryptanalysis of the knapsack generator
FSE'11 Proceedings of the 18th international conference on Fast software encryption
Remote timing attacks are still practical
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Upper-Lower Bounded-Complexity QRD-M for Spatial Multiplexing MIMO-OFDM Systems
Wireless Personal Communications: An International Journal
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On bounded distance decoding for general lattices
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
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
Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
The leakage-resilience limit of a computational problem is equal to its unpredictability entropy
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Secret key leakage from public key perturbation of DLP-Based cryptosystems
Cryptography and Security
A general NTRU-Like framework for constructing lattice-based public-key cryptosystems
WISA'11 Proceedings of the 12th international conference on Information Security Applications
A new lattice-based public-key cryptosystem mixed with a knapsack
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Trapdoors for lattices: simpler, tighter, faster, smaller
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
Lattice-based threshold-changeability for standard CRT secret-sharing schemes
Finite Fields and Their Applications
A complexity analysis of a Jacobi method for lattice basis reduction
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
LLL-reduction for integer knapsacks
Journal of Combinatorial Optimization
Sampling methods for shortest vectors, closest vectors and successive minima
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Fully anonymous attribute tokens from lattices
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
Designs, Codes and Cryptography
Faster gaussian lattice sampling using lazy floating-point arithmetic
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Learning a zonotope and more: cryptanalysis of NTRUSign countermeasures
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Using bleichenbacher's solution to the hidden number problem to attack nonce leaks in 384-bit ECDSA
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
A note on BDD problems with λ2 -gap
Information Processing Letters
Improvements in closest point search based on dual HKZ-bases
Theoretical Computer Science
Lattice-based completely non-malleable public-key encryption in the standard model
Designs, Codes and Cryptography
| Hi-index | 0.13 |