2011, The Open University, My Digital Life: My Society, page 56:
The answer is summed up in Schneier’s Law, attributed to security expert Bruce Schneier by the writer and activist Cory Doctorow: […]
2014, Bruce Schneir, Carry On: Sound Advice from Schneir on Security, page 34:
This is especially true if you want to design security systems and not just implement them. Remember Schneier’s Law: “Any person can invent a security system so clever that she or he can’t think of how to break it.”
2017, Jonathan Jogenfors, Breaking the Unbreakable: Exploiting Loopholes in Bell’s Theorem to Hack Quantum Cryptography, page 6:
This is encapsulated in Schneier's law [12], which states that “anyone, from the most clueless amateur to the best cryptograher, can create an algorithm that he or she himself cannot break”.
2021, Jonathan Peck, Bart Goossens, & Yvan Saeys, "Calibrated Multi-probalistic Prediction as a Defense Against Adversarial Attacks", in Artificial Intelligence and Machine Learning 31st Benelux AI Conference, BNAIC 2019, and 28th Belgian-Dutch Machine Learning Conference, BENELEARN 2019, Brussels, Belgium, November 6-8, 2019, Revised Selected Papers (eds. Bart Bogaerts et al.), page 117:
We recall Schneier's Law [70]: Anyone, from the most clueless amateur to the best cryptographer, can create an algorithm that they themselves cannot break.
2022, Andy Greenberg, Tracers in the Dark: The Global Hunt for the Crime Lords of Cryptocurrency, unnumbered page:
RSA was one of the few fundamental encryption protocols that had not succumbed to Schneier's law in more than thirty years.
2022, Diego Miranda-Saavedra, How to Think About Data Science, page 184:
One unifying truth of computer security is described by Schneier's Law (1998) [267]: Anyone, from the most clueless amateur to the best cryptographer, can create an algorithm that he himself can't break. It's not even hard.
