Affiliation:
1. University of South Wales, United Kingdom of Great Britain and Northern Ireland
Abstract
Abstract
Sudoku grids are often cited as being useful in cryptography as a key for some encryption process. Historically transporting keys over an alternate channel has been very difficult. This article describes how a Sudoku grid key can be secretly transported using quantum key distribution methods whereby partial grid (or puzzle) can be received and the full key can be recreated by solving the puzzle.
Subject
General Chemical Engineering
Reference11 articles.
1. [1] C. Bennett, G. Brassard, S. Breidbart, and S. Wiesner.“Quantum cryptography, or unforgeable subway tokens”, in D. Chaum, R. Rivest, and A. Sherman, editors, Advances in Cryptology, 267-275, Springer US, 1983.
2. [2] C. H. Bennett and G. Brassard.“Quantum cryptography: Public key distribution and coin tossing”, IEEE International Conference on Computers, Systems, and Signal Processing, p. 175, Bangalore, 1984.
3. [3] C. Chang, Y. Chou, and T. D. Kieu.“An information hiding scheme using Sudoku”, ICICIC '08: Proceedings of the 2008 3rd International Conference on Innovative Computing Information and Control, p. 17, Washington, DC, USA, 2008.
4. [4] S. Gupta.“Some results on Su Doku”. http://theory.tifr.res.in/~sgupta/sudoku/theorems.pdf (March 2006)
5. [5] W. Hong, T. Chen, and C. Shiu.“Steganography using Sudoku revisited”, Intelligent Information Technology Application, 2008. IITA '08. Second International Symposium on Intelligent Information Technology Application (IITA'2008), 935-939, Shanghai, 2008.