Good article.
‘Kolmogorov complexity’ is delicious and finding out if something is random once it exists is much harder than asking “Will it Blend”, normally the answer is kind off.
you can certainly inspect the process that generates a given number to see if it was properly devised and executed, but as people were always falling back to axioms, proof is expensive .
“Kerckhoff‘s Principle” is interesting in that it makes perfect sense, unless off course all the secret societies, intelligence agencies have more better mathematicians than those in the public domain… the only logical approach for the confidentiality holy of holies is to use the best closed proprietary crypto-system you have and then wrap it in the best open source crypto-system then Stego it on the outside till the cows come home… of course maybe your Stego makes it more detectable… 🙂
