Sciweavers

52 search results - page 3 / 11
» Algebraic fingerprints for faster algorithms
Sort
View
154
Voted
DAGSTUHL
2007
15 years 7 months ago
From Algebraic Riccati equations to unilateral quadratic matrix equations: old and new algorithms
The problem of reducing an algebraic Riccati equation XCX − AX − XD + B = 0 to a unilateral quadratic matrix equation (UQME) of the kind PX2 + QX + R = 0 is analyzed. New redu...
Dario Andrea Bini, Beatrice Meini, Federico Poloni
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
15 years 10 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
Erich Kaltofen, Victor Shoup
IMC
2006
ACM
15 years 11 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
14 years 9 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir
ICALP
2009
Springer
16 years 6 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams