Sciweavers

129
Voted
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
15 years 10 months ago
A Loopless Gray Code for Minimal Signed-Binary Representations
A string . . . a2a1a0 over the alphabet {−1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n =   k≥0 ak2k and the number of non-zero digits is ...
Gurmeet Singh Manku, Joe Sawada
128
Voted
CC
2005
Springer
115views System Software» more  CC 2005»
15 years 10 months ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...
EUROCRYPT
2007
Springer
15 years 11 months ago
Non-interactive Proofs for Integer Multiplication
Abstract. We present two universally composable and practical protocols by which a dealer can, verifiably and non-interactively, secret-share an integer among a set of players. Mo...
Ivan Damgård, Rune Thorbek
NDSS
2007
IEEE
15 years 11 months ago
RICH: Automatically Protecting Against Integer-Based Vulnerabilities
We present the design and implementation of RICH (Run-time Integer CHecking), a tool for efficiently detecting integer-based attacks against C programs at run time. C integer bug...
David Brumley, Dawn Xiaodong Song, Tzi-cker Chiueh...