Sciweavers

40 search results - page 1 / 8
» How Far Can We Go on the x64 Processors
Sort
View
FSE
2006
Springer
117views Cryptology» more  FSE 2006»
14 years 1 months ago
How Far Can We Go on the x64 Processors?
This paper studies the state-of-the-art software optimization methodology for symmetric cryptographic primitives on the new 64-bit x64 processors, AMD Athlon64 (AMD64) and Intel Pe...
Mitsuru Matsui
ADAEUROPE
1998
Springer
14 years 1 months ago
Automating the Ada Binding Process for Java- How Far Can We Go?
This paper describes an automated approach for generating Ada bindings from Java class files. We start with the set of Java features that require a visible Ada binding, and an Ada ...
David E. Emery, Robert F. Mathias, Karl A. Nyberg
3DPVT
2006
IEEE
162views Visualization» more  3DPVT 2006»
14 years 3 months ago
How Far Can We Go with Local Optimization in Real-Time Stereo Matching
Applications such as robot navigation and augmented reality require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most realtime stereo applic...
Liang Wang, Mingwei Gong, Minglun Gong, Ruigang Ya...
ASIACRYPT
2004
Springer
14 years 2 months ago
How Far Can We Go Beyond Linear Cryptanalysis?
Abstract. Several generalizations of linear cryptanalysis have been proposed in the past, as well as very similar attacks in a statistical point of view. In this paper, we define ...
Thomas Baignères, Pascal Junod, Serge Vaude...
ASPLOS
2008
ACM
13 years 11 months ago
How low can you go?: recommendations for hardware-supported minimal TCB code execution
We explore the extent to which newly available CPU-based security technology can reduce the Trusted Computing Base (TCB) for security-sensitive applications. We find that although...
Jonathan M. McCune, Bryan Parno, Adrian Perrig, Mi...