598 search results - page 13 / 120 » Predicting Lattice Reduction |
153
Voted
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
147
Voted
ANTS
2010
Springer
15 years 7 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
132
click to vote
DLOG
2008
15 years 6 months ago
2008
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
124
Voted
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
143
Voted
IACR
2011
14 years 3 months ago
2011
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...