The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Nous détenons normalement de nombreuses informations confidentielles sur des disques durs et des disques SSD. Lorsque nous voulons effacer de telles informations pour éviter toute fuite, nous devons écraser la séquence d'informations par une séquence de symboles indépendants de l'information. L'écrasement n'est nécessaire qu'aux endroits où les symboles écrasés sont différents des symboles originaux. Ensuite, le coût des écrasements tel que le nombre de symboles écrasés pour effacer les informations est important. Dans cet article, nous clarifions le coût minimum tel que le nombre minimum d'écrasements pour effacer des informations selon des critères d'indépendance faibles et forts. Le premier (resp. le dernier) critère représente que l'information mutuelle entre la séquence originale et la séquence écrasée normalisée (resp. non normalisée) par la longueur des séquences est inférieure à une valeur souhaitée donnée.
Tetsunao MATSUTA
Tokyo Institute of Technology
Tomohiko UYEMATSU
Tokyo Institute of Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Tetsunao MATSUTA, Tomohiko UYEMATSU, "An Information-Theoretical Analysis of the Minimum Cost to Erase Information" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 12, pp. 2099-2109, December 2018, doi: 10.1587/transfun.E101.A.2099.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.2099/_p
Copier
@ARTICLE{e101-a_12_2099,
author={Tetsunao MATSUTA, Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Information-Theoretical Analysis of the Minimum Cost to Erase Information},
year={2018},
volume={E101-A},
number={12},
pages={2099-2109},
abstract={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.},
keywords={},
doi={10.1587/transfun.E101.A.2099},
ISSN={1745-1337},
month={December},}
Copier
TY - JOUR
TI - An Information-Theoretical Analysis of the Minimum Cost to Erase Information
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2099
EP - 2109
AU - Tetsunao MATSUTA
AU - Tomohiko UYEMATSU
PY - 2018
DO - 10.1587/transfun.E101.A.2099
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2018
AB - 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.
ER -