The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
We introduce a new class of computational problems which we call the``one-more-RSA-
inversion''problems. Our main result is that two problems in this class, which we call the …
inversion''problems. Our main result is that two problems in this class, which we call the …
[图书][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …
topics, techniques, and applications. Along with updating and revising many of the existing …
On the complexity of computing determinants
E Kaltofen, G Villard - Computational complexity, 2005 - Springer
We present new baby steps/giant steps algorithms of asymptotically fast running time for
dense matrix problems. Our algorithms compute the determinant, characteristic polynomial …
dense matrix problems. Our algorithms compute the determinant, characteristic polynomial …
[图书][B] Statistical image processing and multidimensional modeling
P Fieguth - 2010 - books.google.com
Images are all around us! The proliferation of low-cost, high-quality imaging devices has led
to an explosion in acquired images. When these images are acquired from a microscope …
to an explosion in acquired images. When these images are acquired from a microscope …
The shifted number system for fast linear algebra on integer matrices
A Storjohann - Journal of Complexity, 2005 - Elsevier
The shifted number system is presented: a method for detecting and avoiding error
producing carries during approximate computations with truncated expansions of rational …
producing carries during approximate computations with truncated expansions of rational …
On computing the resultant of generic bivariate polynomials
G Villard - Proceedings of the 2018 acm international symposium …, 2018 - dl.acm.org
An algorithm is presented for computing the resultant of two generic bivariate polynomials
over a field K. For such p and q K [x, y] both of degree d in x and n in y, the algorithm …
over a field K. For such p and q K [x, y] both of degree d in x and n in y, the algorithm …
[HTML][HTML] Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
Given a nonsingular n× n matrix of univariate polynomials over a field K, we give fast and
deterministic algorithms to compute its determinant and its Hermite normal form. Our …
deterministic algorithms to compute its determinant and its Hermite normal form. Our …
On computing the determinant and Smith form of an integer matrix
W Eberly, M Giesbrecht, G Villard - Proceedings 41st Annual …, 2000 - ieeexplore.ieee.org
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix.
For a matrix A/spl isin/Z/sup n/spl times/n/the algorithm requires O (n/sup 3.5/(log n)/sup 4.5/) …
For a matrix A/spl isin/Z/sup n/spl times/n/the algorithm requires O (n/sup 3.5/(log n)/sup 4.5/) …
The power of RSA inversion oracles and the security of Chaum's RSA-based blind signature scheme
Blind signatures are the central cryptographic component of digital cash schemes. In this
paper, we investigate the security of the first such scheme proposed, namely Chaum's RSA …
paper, we investigate the security of the first such scheme proposed, namely Chaum's RSA …
On solutions of linear functional systems
SA Abramov, M Bronstein - … of the 2001 international symposium on …, 2001 - dl.acm.org
We describe a new direct algorithm for transforming a linear system of recurrences into an
equivalent one with nonsingular leading or trailing matrix. Our algorithm, which is an …
equivalent one with nonsingular leading or trailing matrix. Our algorithm, which is an …