2,073 research outputs found
Total positivity and accurate computations with Gram matrices of Said-Ball bases
In this article, it is proved that Gram matrices of totally positive bases of the space of polynomials of a given degree on a compact interval are totally positive. Conditions to guarantee computations to high relative accuracy with those matrices are also obtained. Furthermore, a fast and accurate algorithm to compute the bidiagonal factorization of Gram matrices of the Said-Ball bases is obtained and used to compute to high relative accuracy their singular values and inverses, as well as the solution of some linear systems associated with these matrices. Numerical examples are included
Total positivity and accurate computations with Gram matrices of Bernstein bases
In this paper, an accurate method to construct the bidiagonal factorization of Gram (mass) matrices of Bernstein bases of positive and negative degree is obtained and used to compute with high relative accuracy their eigenvalues, singular values and inverses. Numerical examples are included
A kilobit hidden SNFS discrete logarithm computation
We perform a special number field sieve discrete logarithm computation in a
1024-bit prime field. To our knowledge, this is the first kilobit-sized
discrete logarithm computation ever reported for prime fields. This computation
took a little over two months of calendar time on an academic cluster using the
open-source CADO-NFS software. Our chosen prime looks random, and
has a 160-bit prime factor, in line with recommended parameters for the Digital
Signature Algorithm. However, our p has been trapdoored in such a way that the
special number field sieve can be used to compute discrete logarithms in
, yet detecting that p has this trapdoor seems out of reach.
Twenty-five years ago, there was considerable controversy around the
possibility of back-doored parameters for DSA. Our computations show that
trapdoored primes are entirely feasible with current computing technology. We
also describe special number field sieve discrete log computations carried out
for multiple weak primes found in use in the wild. As can be expected from a
trapdoor mechanism which we say is hard to detect, our research did not reveal
any trapdoored prime in wide use. The only way for a user to defend against a
hypothetical trapdoor of this kind is to require verifiably random primes
Algorithms for curve design and accurate computations with totally positive matrices
Esta tesis doctoral se enmarca dentro de la teoría de la Positividad Total. Las matrices totalmente positivas han aparecido en aplicaciones de campos tan diversos como la Teoría de la Aproximación, la Biología, la Economía, la Combinatoria, la Estadística, las Ecuaciones Diferenciales, la Mecánica, el Diseño Geométrico Asistido por Ordenador o el Álgebra Numérica Lineal. En esta tesis nos centraremos en dos de los campos que están relacionados con matrices totalmente positivas.This doctoral thesis is framed within the theory of Total Positivity. Totally positive matrices have appeared in applications from fields as diverse as Approximation Theory, Biology, Economics, Combinatorics, Statistics, Differential Equations, Mechanics, Computer Aided Geometric Design or Linear Numerical Algebra. In this thesis, we will focus on two of the fields that are related to totally positive matrices.<br /
- …