Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Gutmann Method

Cryptographic Algorithm

The Gutmann method is an algorithm for securely erasing data from hard disk drives and other storage media, developed by Peter Gutmann and Colin Plumb and presented in their 1996 paper on secure deletion of data from magnetic and solid-state memory. It overwrites the target storage area with a sequence of 35 distinct patterns, most of them designed for the encoding schemes used by older MFM and RLL hard disks, on the assumption that the user does not know which encoding scheme a given drive uses. Gutmann later noted that the method had become less relevant as modern drives moved away from those encoding schemes, and since around 2001 many ATA IDE and SATA drives support the ATA Secure Erase standard, which removes the need to apply his 35-pass method for a complete erase. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Connections

In Field

Source Wikipedia: Gutmann method
Sources
Wikipedia: Gutmann method
  • Lead section
    The Gutmann method is an algorithm for securely erasing the contents of computer hard disk drives, such as files.
  • In Field: Information Security, Lead paragraph
View the Source
Wikidata: Gutmann Method
Wikidata Q1557243, class allow-list match (w-wdresolver-0926)View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.