Sciweavers

2233 search results - page 24 / 447
» On the Complexity of Theory Curbing
Sort
View
IACR
2011
135views more  IACR 2011»
14 years 1 months ago
Algebraic Complexity Reduction and Cryptanalysis of GOST
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. Its large key size of 256 bits at a particularly low implementa...
Nicolas Courtois
111
Voted
LICS
1999
IEEE
15 years 6 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
109
Voted
JSC
2010
94views more  JSC 2010»
15 years 9 days ago
P versus NP and geometry
In this primarily expository article, I describe geometric approaches to variants of P v. NP, present several results that illustrate the role of group actions in complexity theory...
J. M. Landsberg
111
Voted
CORR
2004
Springer
110views Education» more  CORR 2004»
15 years 1 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi
126
Voted
IFIP
2010
Springer
14 years 8 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro