Sciweavers

15 search results - page 2 / 3
» Algebraic Attacks on Summation Generators
Sort
View
JCSS
2008
159views more  JCSS 2008»
13 years 7 months ago
Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models
Internet worms are classically described using SIR models and simulations, to capture the massive dynamics of the system. Here we are able to generate a differential equation-base...
Jeremy T. Bradley, Stephen T. Gilmore, Jane Hillst...
TON
2002
102views more  TON 2002»
13 years 7 months ago
A min, + system theory for constrained traffic regulation and dynamic service guarantees
By extending the system theory under the (min, +) algebra to the time-varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic ser...
Cheng-Shang Chang, Rene L. Cruz, Jean-Yves Le Boud...
EUROCRYPT
2006
Springer
13 years 11 months ago
How to Strengthen Pseudo-random Generators by Using Compression
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebrai...
Aline Gouget, Hervé Sibert
FSE
2005
Springer
122views Cryptology» more  FSE 2005»
14 years 1 months ago
Analysis of the Bit-Search Generator and Sequence Compression Techniques
Abstract. Algebraic attacks on stream ciphers apply (at least theoretically) to all LFSR-based stream ciphers that are clocked in a simple and/or easily predictable way. One intere...
Aline Gouget, Hervé Sibert, Côme Berb...
IFIP
2009
Springer
13 years 5 months ago
Finite Models in FOL-Based Crypto-Protocol Verification
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
Jan Jürjens, Tjark Weber