Crypto-PAn

Crypto-PAn (Cryptography-based Prefix-preserving Anonymization^[1]) is a cryptographic algorithm for anonymizing IP addresses while preserving their subnet structure. That is, the algorithm encrypts any string of bits $x$ to a new string $E_{k}(x)$ , while ensuring that for any pair of bit-strings $x,y$ which share a common prefix of length $p$ , their images $E_{k}(x),E_{k}(y)$ also share a common prefix of length $p$ . A mapping with this property is called prefix-preserving.^[2] In this way, Crypto-PAn is a kind of format-preserving encryption.

The mathematical outline of Crypto-PAn was developed by Jinliang Fan, Jun Xu, Mostafa H. Ammar (all of Georgia Tech) and Sue B. Moon.^[3] It was inspired^[3] by the IP address anonymization done by Greg Minshall's TCPdpriv program circa 1996.

^ Cite error: The named reference refimpl was invoked but never defined (see the help page).
^ Cite error: The named reference Xu2001 was invoked but never defined (see the help page).
^ ^a ^b Cite error: The named reference Xu2002 was invoked but never defined (see the help page).

[refimpl-1] Cite error: The named reference refimpl was invoked but never defined (see the help page).

[Xu2001-2] Cite error: The named reference Xu2001 was invoked but never defined (see the help page).

[Xu2002-3] Cite error: The named reference Xu2002 was invoked but never defined (see the help page).

[1]

[2]

[3]