Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators

Lecture Notes in Computer Science - Germany
doi 10.1007/11799313_11
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

BDD-Based Cryptanalysis of Keystream Generators

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Electrochemical DNA Biosensor Based on the BDD Nanograss Array Electrode

Chemistry Central Journal
Chemistry
2013English

Statistical Complexity of Chaotic Pseudorandom Number Generators

2013English

The Complexity of Constructing Pseudorandom Generators From Hard Functions

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2005English

BDD Path Length Minimization Based on Initial Variable Ordering

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2005English

Computational Complexity of Generators and Nongenerators in Algebra

International Journal of Algebra and Computation
Mathematics
2002English

BDD-based Verification of Scalable Designs

Facta universitatis - series: Electronics and Energetics
2007English

Complexity of Differential Attacks on SHA-0 With Various Message Schedules

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Electronic EngineeringComputer GraphicsSignal ProcessingApplied MathematicsElectricalComputer-Aided Design
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy