Sciweavers

237 search results - page 7 / 48
» MapReduce for Integer Factorization
Sort
View
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
14 years 4 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...
ASIACRYPT
2003
Springer
14 years 3 months ago
Some RSA-Based Encryption Schemes with Tight Security Reduction
In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encr...
Kaoru Kurosawa, Tsuyoshi Takagi
JSC
2006
132views more  JSC 2006»
13 years 9 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
DM
2000
76views more  DM 2000»
13 years 9 months ago
On the number of ordered factorizations of natural numbers
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
Benny Chor, Paul Lemke, Ziv Mador
DCC
2008
IEEE
14 years 9 months ago
A Simple Algorithm for Computing the Lempel Ziv Factorization
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
Maxime Crochemore, Lucian Ilie, W. F. Smyth