Sciweavers

147
Voted
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
15 years 4 months ago
The Berlekamp-Massey Algorithm revisited
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...
Nadia Ben Atti, Gema M. Diaz-Toca, Henri Lombardi
184
Voted
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
15 years 10 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...