Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions

Author

Beckmann, Andreas ; Keller, Jörg

Author_Institution

Inst. fur Informatik, Martin-Luther-Univ. Halle-Wittenberg, Halle

fYear

2007

fDate

7-9 Feb. 2007

Firstpage

526

Lastpage

533

Abstract

We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite state machines such as pseudorandom number generators in cryptography. The size of the graphs necessitates that the adjacency list is kept on hard disks. Our algorithm uses multiple processing units, so that a parallel storage system has to be employed to store the graph. We present experimental results for randomly chosen graphs, and for the graph of the A5/1 generator used in GSM mobile phones

Keywords

cellular radio; cryptography; directed graphs; finite state machines; hard discs; mobile handsets; parallel algorithms; random number generation; GSM mobile phones; finite state machines; hard disks; invertible cryptographic functions; multiple processing units; parallel storage systems; pseudorandom number generators; Automata; Base stations; Clustering algorithms; Concurrent computing; Cryptography; GSM; Hard disks; Mobile handsets; Tree graphs; Very large scale integration; cryptography; parallel graph algorithms; parallel storage systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel, Distributed and Network-Based Processing, 2007. PDP '07. 15th EUROMICRO International Conference on

Conference_Location

Napoli

ISSN

1066-6192

Print_ISBN

0-7695-2784-1

Type

conf

DOI

10.1109/PDP.2007.61

Filename

4135319