de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
Schliessen
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Werk suchen
Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs / by Heinrich Riebler. Paderborn, 2019
Inhalt
Acknowledgements
Abstract
Zusammenfassung
Table of Contents
Introduction
Contributions Overview
Thesis Structure
Foundations: Reconfigurable Computing
Field-Programmable Accelerators
Design Flow of Hardware Acceleration
MaxCompiler Programming Model
Host Application
Kernel
Manager
State Machines
Compilation Tool Flow
Chapter Conclusion
Excursion to Cryptography and Information Security
Introduction to Side-Channel Attacks
Cold-Boot Attacks
Remanence Effect of Main Memory
Attack Vector and Relevance
Modeling Bit Errors
Perfect Asymmetric Decay
Expected Value as Threshold
Advanced Encryption Standard
Key Schedule: Secret Key and Round Keys
Secret Key Expansion
Fundamental Cryptographic Principles
Chapter Conclusion
Intermediate Findings: Identification of Secret Key Material
Basic Idea and Software Approach
Hardware Implementation
Input
Heuristics
Computation of Reference Key Schedule
Computation of the Hamming Distances
Evaluation
Software Reference
Kernel Replication
Results
Discussion
Chapter Conclusion
Branch-and-Bound with Reconfigurable Hardware
Basics and Common Terminology
Tree Data Structure
Traversal Strategies: Tree Structure and Search Path
Branch-and-Bound: General Idea
Algorithmic Pattern
State Machine Design for Reconfigurable Hardware
Case Study: Secret Key Reconstruction
Basic Idea
Software Approach
Bounding the Search Space: Error Model
Branch-and-Bound in Hardware
Software Translation: Concrete Finite State Machine
Selecting Branches
Computing Inferred Knowledge: Implication Chains
Checkpointing Tree Traversal
Maintaining the Bound: Applying Error Model
Evaluation
Target Platforms
Error Metrics
Evaluation Scenario
Software Implementation
Performance Comparison of Software to Hardware
Chapter Conclusion
Work Stealing with Reconfigurable Hardware
Motivation and General Description
Extensions of the General State Machine
Coordination and Synchronization of Stealing
Initialization and Termination
Evaluation
Evaluation Scenario
Results
Chapter Conclusion
Instance-Specific Computing with Reconfigurable Hardware
Motivation and General Description
Methods for Customization
Generation of Instance-Specific Designs
Instance-Specific Branch-and-Bound Search Trees
Instance-Specific Branching Order
Generating Valid and Optimal Search Tree Structures
Selecting Instance-Specific Search Tree Structures
Generation of Instance-Specific Hardware Designs
Evaluation
Results
On-the-Fly Hardware Synthesis
Discussion and Practical Considerations
Chapter Conclusion
Related Work
Side-Channel and Cold-Boot Attacks
Acquisition of Sensitive Data
Search and Extraction of Secret Key Material
Reconstruction of Secret Keys
Branch-and-Bound in Soft- and Hardware
Parallelization and Work Stealing
Instance-Specific Computing
Chapter Conclusion
Conclusion
Summary
Outlook
List of Tables
List of Listings
List of Figures
Acronyms
Supplemental Material
Author's Publications
Bibliography
Die detaillierte Suchanfrage erfordert aktiviertes Javascript.