wiki:KeySearcher

KeySearcher OpenCL

TODO: Distributed KeySearcher code analysis.

Keysearcher Classes

A class diagramm of the keysearcher can be found in the attachments.

Packet Structure

The keysearcher stores local results in a Distributed Hash Table (the DHT) to work with a distributed bruteforce. The packets stored within the DHT are defined by the following structure:
Section...|.Source.....|.Bytes/Type..


Version:
............Magic 'V'.......1Byte
............version.........4Byte

Results:
............count...........4Byte
repeat count times
|...........key...............String
|...........keya.length.....Int32
|...........keya...............byte[keya.length]
|...........value.............double
|...........dec.length......4Byte
|...........decryption......Byte[]
|...........user..............String
|...........buffertime......long
|...........machID..........long
|...........machName......String

Statistic:
............avatarcount.....4Byte
repeat avatarcount times
|...........avatarname......String
|...........machcount.......4Byte
|.repeat machcount times
|.|.........machID...........long
|.|.........patternsum......4Byte
|.|.........hostname........String
|.|.........time...............long

Node/Leaf:
............type...............1Byte

............if(type == 0)
............reserv. date.....long
............clientID...........long

............if(type == 1)
............leftchildfin.......bool
............rightchildfin......bool
............leftchildintegr....bool
............rightchildintegr...bool

HASH:
............SHA256(DATA+JID).32Byte


DATA is the whole package without the Hash and JID is the Job ID.

The complete packetstructure is shown in the picture added to the attachments of this report.

Last modified 8 years ago Last modified on Mar 18, 2011, 9:28:22 PM

Attachments (2)

Download all attachments as: .zip