534 search results - page 56 / 107 » Efficient polynomial L-approximations |
MICRO
1997
IEEE
14 years 1 days ago
1997
IEEE
High performance architectures depend heavily on efficient multi-level memory hierarchies to minimize the cost of accessing data. This dependence will increase with the expected i...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper describes new techniques for fast correlation attacks, based on Gallager iterative decoding algorithm using parity-check equations of weight greater than 3. Th...