66 search results - page 2 / 14 » Secure Linear Algebra Using Linearly Recurrent Sequences |
LSSC
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Existing Recurrent Neural Networks (RNNs) are limited in their ability to model dynamical systems with nonlinearities and hidden internal states. Here we use our general framework...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
SC
2009
ACM
14 years 3 months ago
2009
ACM
Memory bandwidth limits the performance of important kernels in many scientific applications. Such applications often use sequences of Basic Linear Algebra Subprograms (BLAS), an...
EUROCRYPT
2003
Springer
14 years 1 months ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...