Sciweavers

189 search results - page 2 / 38
» Interpolation of Functions Related to the Integer Factoring ...
Sort
View
TACAS
2010
Springer
146views Algorithms» more  TACAS 2010»
14 years 8 days ago
Ranking Function Synthesis for Bit-Vector Relations
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
Byron Cook, Daniel Kroening, Philipp Rümmer, ...
EUROCRYPT
2000
Springer
13 years 9 months ago
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...
Daniel Bleichenbacher, Phong Q. Nguyen
ITA
2008
123views Communications» more  ITA 2008»
13 years 5 months ago
On some problems related to palindrome closure
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
13 years 10 months ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
ICICS
2004
Springer
13 years 10 months ago
Factorization-Based Fail-Stop Signatures Revisited
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
Katja Schmidt-Samoa