251 search results - page 3 / 51 » An Improved Linear Syndrome Algorithm in Cryptanalysis With ... |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
FUIN
2010
13 years 6 months ago
2010
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
BMCBI
2006
13 years 7 months ago
2006
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...