Also known as: security by obscurity
Obfuscation hides the meaning of data without a secret key, so anyone who learns the method can reverse it.1 It is “security by obscurity,” and it is fundamentally different from encryption: there is no key whose absence keeps the data safe.
How it works
Obfuscation transforms data by a fixed procedure — a permutation, a substitution table, a shift-register update — with no secret parameter. Because the only thing protecting it is that the method is undocumented, it fails the moment the method is recovered. This is the exact situation Kerckhoffs’s principle warns against: a system whose security collapses once the algorithm is known offers no real confidentiality.
Working out an obfuscation scheme is a cryptanalysis exercise, but a tractable one: with enough observed input/output, the transformation can be reconstructed because there is no key to search for. Once reconstructed, it is reversible forever by anyone.
Relevance to SDR
Obfuscation appears regularly on trunked systems and is easy to mistake for encryption. The Motorola P25 talker-alias scheme is the leading example: the operator-entered alias text is transformed by a keyless, reversible method, which makes it obfuscation, not encryption. GopherTrunk’s handling of it was developed clean-room in issue #773 — the transformation was reconstructed solely from publicly observable over-the-air data, never from any third-party source, by hypothesizing candidate update rules (shift-register and round-function shaped models) and testing them until a 256-entry substitution table was recovered. Because there is no key, the alias can be displayed; truly encrypted voice (RC4 or AES) is a different matter entirely and stays opaque. Related keyless transforms include scrambling whitening, which balances a signal rather than hiding its meaning.
Sources
-
Obfuscation — Wikipedia, for obfuscation as hiding meaning without a key and its relation to security by obscurity. ↩