81 search results - page 16 / 17 » Improving Fast Algebraic Attacks |
131
click to vote
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
15 years 8 months ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
144
click to vote
CASES
2003
ACM
15 years 8 months ago
2003
ACM
Bank locality can be defined as localizing the number of load/store accesses to a small set of memory banks at a given time. An optimizing compiler can modify a given input code t...
130
click to vote
RAID
2009
Springer
15 years 9 months ago
2009
Springer
Due to the rapid advancement of mobile communication technology, mobile devices nowadays can support a variety of data services that are not traditionally available. With the growi...
160
click to vote
ICISC
2000
15 years 4 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
149
click to vote
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...