Algorithm definition
The Algorithm definition window shows you a template of the future algorithm.
The window has the following legend: The first column of the list contains the type of operation on a disk (there are just two: to write a symbol to disk, “writing”; and to verify written, “verification”); the second column contains the pattern of data to be written to disk.
The pattern to be written is always a hexadecimal value, for example, a value of this kind: 0×00, 0xAA, or 0xCD, etc. These values are 1 byte long, but they may be up to 512 bytes long. Except for such values, you may enter a random hexadecimal value of any length (up to 512 bytes). Your algorithm may also include one more value for writing that is designated as the «complementary value» – the value that is complementary to the one written to disk during the previous pass.
If the binary value is represented by the 10001010 (0x8A) sequence, then the complementary binary value will be represented by the 01110101 (0×75) sequence.
The Algorithm definition window offers you the template for the algorithm only. You should define exactly what the software should write to disk to destroy the confidential data according to your algorithm.
To do this, click your mouse on the line representing pass #1 and click Edit.