BDD-Based Attacks

Andreas Klein
Additional contact information
Andreas Klein: State University of Ghent, Dept. of Pure Mathem. & Computer Algebra

Chapter Chapter 5 in Stream Ciphers, 2013, pp 117-130 from Springer

Abstract: Abstract Binary Decision Diagrams (BDDs) are an efficient way to store and manipulate Boolean functions. BDD-based attacks are a new a quite successful variant of time-memory trade-off attacks. We will learn to handle BDDs and finally investigate a BDD-based attack against E 0 (Bluetooth) as a real world example.

Keywords: Binary Decision Diagrams (BDD); Boolean Function; Free BDD; Natural Variable Ordering; Control Graph (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4471-5079-4_5

Ordering information: This item can be ordered from
http://www.springer.com/9781447150794

DOI: 10.1007/978-1-4471-5079-4_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().