Changes

Jump to navigation Jump to search
m
→‎Shredding: Spell Check, typos fixed: also know as → also known as
Line 14: Line 14:     
===Shredding===
 
===Shredding===
−
The process of "shredding" (also know as secure deletion) is designed to prevent recovery, and does so quite effectively.  Although information which is overwritten once can sometimes be recovered, a good shredding algorithm overwrites the file's disk space three to thirty-two times, each time with a different randomly generated block of gibberish.  Some programs offer to run this process sixty-four times or more, but this is usually unnecessary.  Even two or three passes will usually destroy the data altogether<!--, although some say that certain government agencies can see back up to seven overwrites{{citation needed}}-->.  It has been shown that using Magnetic Force Scanning Tunneling Microscopy (Which is generally used to test and improved read/write heads) can detect "shadows" of the previously stored bits can be detected, even though this process would take years to complete.<ref>http://www.nber.org/sys-admin/overwritten-data-gutmann.html</ref><ref>https://www.usenix.org/legacy/publications/library/proceedings/sec96/full_papers/gutmann/index.html</ref> However, after a sufficient number of passes have been completed, there is no known way to recover it.  For this reason, shredding should only be performed when the user is absolutely sure they wish to obliterate certain information. Also, shredding causes a little extra wear on the drive, which can be more harmful to [[Flash memory]] than disk drives.  Additionally, due to wear-leveling algorithms employed by flash memory storage, shredding is nearly impossible with any certainty.<ref>http://www.pcworld.com/article/261702/how_to_securely_erase_your_hard_drive.html</ref> If shredding is not needed, it probably should not be used lest it eventually cause a malfunction.
+
The process of "shredding" (also known as secure deletion) is designed to prevent recovery, and does so quite effectively.  Although information which is overwritten once can sometimes be recovered, a good shredding algorithm overwrites the file's disk space three to thirty-two times, each time with a different randomly generated block of gibberish.  Some programs offer to run this process sixty-four times or more, but this is usually unnecessary.  Even two or three passes will usually destroy the data altogether<!--, although some say that certain government agencies can see back up to seven overwrites{{citation needed}}-->.  It has been shown that using Magnetic Force Scanning Tunneling Microscopy (Which is generally used to test and improved read/write heads) can detect "shadows" of the previously stored bits can be detected, even though this process would take years to complete.<ref>http://www.nber.org/sys-admin/overwritten-data-gutmann.html</ref><ref>https://www.usenix.org/legacy/publications/library/proceedings/sec96/full_papers/gutmann/index.html</ref> However, after a sufficient number of passes have been completed, there is no known way to recover it.  For this reason, shredding should only be performed when the user is absolutely sure they wish to obliterate certain information. Also, shredding causes a little extra wear on the drive, which can be more harmful to [[Flash memory]] than disk drives.  Additionally, due to wear-leveling algorithms employed by flash memory storage, shredding is nearly impossible with any certainty.<ref>http://www.pcworld.com/article/261702/how_to_securely_erase_your_hard_drive.html</ref> If shredding is not needed, it probably should not be used lest it eventually cause a malfunction.
    
===Malfunction===
 
===Malfunction===
Block, SkipCaptcha, apieditor, Automoderated users, Bots, edit, ratelimit-exempt
58,343

edits

Navigation menu