Passphrase with semantic noises and a proof on its higher information rate


Lee, Kok-Wah and Ewe, Hong-Tat (2007) Passphrase with semantic noises and a proof on its higher information rate. In: International Conference on Computational Intelligence and Security, 15-19 DEC 2007 , Harbin, PEOPLES R CHINA.

Full text not available from this repository.


Key size becomes very important to a cryptographic algorithm according to Kerckhoffs law where a civilian cryptosystem shall depend fully on key secrecy. Currently, there are four passphrase generation methods: Sentence, acronym, diceware, and coinware. Unicity distance is the minimum size of ciphertext for unique decipherability of ciphertext when number of spurious keys is zero. A key with size less than unicity distance is good where there are spurious keys which allow a protection method using limited unsuccessful logins. Here, stronger forms of passphrases using textual semantic noises like punctuation marks, mnemonic substitution, misspelling, and associative morphing, which improve the key entropy, are proposed An ASCII mutual substitution table is presented together with its proof on information rate increment. Higher information rate has lower redundancy, and hence bigger unicity distance ensures encrypted keys the short cryptogram in a key vault, like Password Safe, cannot be cryptanalyzed within certain limited login attempts. Document Type: Proceedings Paper

Item Type: Conference or Workshop Item (Paper)
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 18 Oct 2011 02:37
Last Modified: 18 Oct 2011 02:37


Downloads per month over past year

View ItemEdit (login required)