An Information-Theoretical Analysis of the Minimum Cost to Erase Information
| Autor: | Matsuta, Tetsunao, Uyematsu, Tomohiko |
|---|---|
| Rok vydání: | 2018 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1587/transfun.E101.A.2099 |
| Popis: | We normally hold a lot of confidential information in hard disk drives and solid-state drives. When we want to erase such information to prevent the leakage, we have to overwrite the sequence of information with a sequence of symbols independent of the information. The overwriting is needed only at places where overwritten symbols are different from original symbols. Then, the cost of overwrites such as the number of overwritten symbols to erase information is important. In this paper, we clarify the minimum cost such as the minimum number of overwrites to erase information under weak and strong independence criteria. The former (resp. the latter) criterion represents that the mutual information between the original sequence and the overwritten sequence normalized (resp. not normalized) by the length of the sequences is less than a given desired value. Comment: 11 pages, 1 figure, improved exposition of related studies, added examples in section 2 and some remarks, submitted to IEICE Trans. Fundamentals |
| Databáze: | arXiv |
| Externí odkaz: |
|