Eraser is an advanced security tool, which allows you to completely remove sensitive data from your hard disk by overwriting it several times with carefully selected patterns.
You can drag and drop files and folders to the on-demand eraser, use the convenient Explorer shell extension or use the integrated scheduler to program overwriting of unused disk space or, for example, browser cache files to happen regularly, at night, during your lunch break, at weekends or whenever you like.
The patterns used for overwriting are based on Peter Gutmann's paper "Secure Deletion of Data from Magnetic and Solid-State Memory" and they are selected to effectively remove the magnetic remnants from the hard disk making it impossible to recover the data.
Other methods include the one defined in the National Industrial Security Program Operating Manual of the US Department of Defense and overwriting with pseudorandom data.
How does it Erase Data i hear you cry...well heres some more crap from the help file incase your wondering....
This method is based on Peter Gutmann’s paper “Secure Deletion of Data from Magnetic and Solid-State Memory”. In chapter “Erasure of Data from Magnetic Media” he represents 27 deterministic passes that should overwrite the data despite drive encoding.
Pass Pattern (binary, hex)
1 01010101 01010101 01010101, 0x55
2 10101010 10101010 10101010, 0xAA
3 10010010 01001001 00100100, 0x92 0x49 0x24
4 01001001 00100100 10010010, 0x49 0x24 0x92
5 00100100 10010010 01001001, 0x24 0x92 0x49
6 00000000 00000000 00000000, 0x00
7 00010001 00010001 00010001, 0x11
8 00100010 00100010 00100010, 0x22
9 00110011 00110011 00110011, 0x33
10 01000100 01000100 01000100, 0x44
11 01010101 01010101 01010101, 0x55
12 01100110 01100110 01100110, 0x66
13 01110111 01110111 01110111, 0x77
14 10001000 10001000 10001000, 0x88
15 10011001 10011001 10011001, 0x99
16 10101010 10101010 10101010, 0xAA
17 10111011 10111011 10111011, 0xBB
18 11001100 11001100 11001100, 0xCC
19 11011101 11011101 11011101, 0xDD
20 11101110 11101110 11101110, 0xEE
21 11111111 11111111 11111111, 0xFF
22 10010010 01001001 00100100, 0x92 0x49 0x24
23 01001001 00100100 10010010, 0x49 0x24 0x92
24 00100100 10010010 01001001, 0x24 0x92 0x49
25 01101101 10110110 11011011, 0x6D 0xB6 0xDB
26 10110110 11011011 01101101, 0xB6 0xDB 0x6D
27 11011011 01101101 10110110, 0xDB 0x6D 0xB6
These deterministic passes should be committed in random order to make it more difficult for an opponent to recover the data. Permutation should be done with cryptographically strong random number generator.
Eraser shuffles the pass array using its own cryptographically strong random number generator based on the one described in Dr. Gutmann’s paper “Software Generation of Practically Strong Random Numbers”. Tiger hash function by Ross Anderson and Eli Biham is used for mixing the entropy pool.
It is also stated that the overwriting sequence can be slightly improved by performing random passes before and after the deterministic passes above.
Eraser writes four passes containing random data before and after writing the deterministic passes in random order, therefore ending up with total 35 passes. The data used in the random passes is created using the ISAAC pseudorandom number generator.
--------------
These two methods are based on “National Industrial Security Program Operating Manual”, NISPOM (also known as US DoD 5220.22-M), of United States Department of Defense from January 1995 (chapter 8, section 3, 8-306. Maintenance).
The first alternative consists of parts E (which is D without verifying), C and E (once more) of the clearing and sanitization matrix.
Pass Matrix Pattern
1 E [1] Random character X
2 E [2] Bit-wise complement of X
3 E [3] Random data
4 C Random character Y
5 E [1] Random character Z
6 E [2] Bit-wise complement of Z
7 E [3] Random data
X, Y, Z = [0,255]
The latter version includes only part E of the matrix, and the first two passes consist of constants instead of random characters.
Pass Matrix Pattern
1 E [1] 00000000, 0x00
2 E [2] 11111111, 0xFF
3 E [3] Random data
All random data is created with the ISAAC pseudorandom number generator.
Even though these overwriting methods are faster than the Gutmann method, they are less secure, especially when there is a chance that someone will try to use hardware recovery methods in attempt to restore the previous data.
-------------------------
Cryptographically strong pseudorandom data used for overwriting is created using the ISAAC (Indirection, Shift, Accumulate, Add and Count) algorithm by Bob Jenkins. The ISAAC generator is reseeded before each task using Eraser’s own multi-source polling random number generator.
The random data generated using ISAAC is guaranteed to have a period length of 2^40 numbers, and the average cycle is 2^8295 32-bit (4-byte) numbers. Therefore, the average amount of data provided by the generator before the sequence starts from the beginning is 4.12e2488 gigabytes (and is at least 4096 gigabytes), which is more than enough for overwriting even the largest hard drives.
The number of overwriting passes for this method is user selectable, the maximum being ((2^16) - 1) = 65535 passes.
For more information, see the source code.
http://www.tolvanen.com/eraser/
is its webby.
dont know if thats what you want but its what ive been using after i ran an 'undelete' program and saw mountains of stuff i tohught was gone