Explaining cryptographic systems
Bell, T.C., Thimbleby, H., Fellows, M., Witten, I.H., Koblitz, N. & Powell, M. (2003). Explaining cryptographic systems. Computers and Education, 40(3), 199-215.
Permanent Research Commons link: https://hdl.handle.net/10289/1820
Modern cryptography can achieve levels of security and authentication that non-specialists find literally incredible. Techniques including information-hiding protocols, zero-knowledge proofs and public key cryptosystems can be used to support applications like digital signatures, digital cash, on-line poker and secure voting in ways that are provably secure—far more secure than the traditional systems they replace. This paper describes simple versions of such applications that have been used to give school-children and the general public a broad understanding of what can be achieved, and how. The material has been extensively and successfully used by the authors in schools, science festivals and with undergraduates, and even postgraduate specialists.
This is an author’s version of an article published in the journal: Computers and Education, (c) 2003 Elsevier B. V.