Sciweavers

2397 search results - page 7 / 480
» Applications of integer relation algorithms
Sort
View
DIMVA
2006
13 years 11 months ago
Using Type Qualifiers to Analyze Untrusted Integers and Detecting Security Flaws in C Programs
Incomplete or improper input validation is one of the major sources of security bugs in programs. While traditional approaches often focus on detecting string related buffer overfl...
Ebrima N. Ceesay, Jingmin Zhou, Michael Gertz, Kar...
SCN
2010
Springer
129views Communications» more  SCN 2010»
13 years 8 months ago
Improved Primitives for Secure Multiparty Integer Computation
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
Octavian Catrina, Sebastiaan de Hoogh
IPCO
2007
140views Optimization» more  IPCO 2007»
13 years 11 months ago
Cuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
Alper Atamtürk, Vishnu Narayanan
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 10 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
EUROCRYPT
2004
Springer
14 years 3 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron