loading...
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
Naples, Italy February 07-February 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDP.2007.6115th Euromicro International Conferen ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Andreas Beckmann, Jorg Keller, "Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions," Parallel, Distributed, and Network-Based Processing, Euromicro Conference on, pp. 526-533, 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/PDP.2007.61,
author = {Andreas Beckmann and Jorg Keller},
title = {Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions},
journal ={Parallel, Distributed, and Network-Based Processing, Euromicro Conference on},
volume = {0},
year = {2007},
issn = {1066-6192},
pages = {526-533},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDP.2007.61},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
TI - Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
SN - 1066-6192
SP526
EP533
A1 - Andreas Beckmann,
A1 - Jorg Keller,
PY - 2007
KW - parallel storage systems
KW - parallel graph algorithms
KW - cryptography
VL - 0
JA - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
ER -
 
Andreas Beckmann, Martin-Luther-Universitat Halle-Wittenberg, Germany
Jorg Keller, FernUniversitat in Hagen, Germany
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 pseudo-random 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.
Index Terms:
parallel storage systems, parallel graph algorithms, cryptography
Citation:
Andreas Beckmann, Jorg Keller, "Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions," pdp, pp.526-533, 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.