Sciweavers

314 search results - page 34 / 63
» Arithmetic Coding Revisited
Sort
View
EUROCRYPT
2004
Springer
15 years 3 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz
AMAI
2004
Springer
15 years 1 months ago
Using Logic Programs to Reason about Infinite Sets
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Rem...
OTM
2007
Springer
15 years 4 months ago
Compiler Assisted Elliptic Curve Cryptography
Abstract. Although cryptographic implementation tasks are often undertaken by expert programmers, a plethora of performance and security driven options, as well as more mundane sof...
Manuel Barbosa, Andrew Moss, Dan Page
CC
2001
Springer
131views System Software» more  CC 2001»
15 years 2 months ago
Compiler Transformation of Pointers to Explicit Array Accesses in DSP Applications
Abstract. Efficient implementation of DSP applications are critical for embedded systems. However, current applications written in C, make extensive use of pointer arithmetic maki...
Björn Franke, Michael F. P. O'Boyle
ENDM
2010
86views more  ENDM 2010»
14 years 10 months ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...