Passphrase with semantic noises and a proof on its higher information rate
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 cipher...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/3208/ |
| _version_ | 1848790264310661120 |
|---|---|
| author | Lee, Kok-Wah Ewe, Hong-Tat |
| author_facet | Lee, Kok-Wah Ewe, Hong-Tat |
| author_sort | Lee, Kok-Wah |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | 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 |
| first_indexed | 2025-11-14T18:09:51Z |
| format | Conference or Workshop Item |
| id | mmu-3208 |
| institution | Multimedia University |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:09:51Z |
| publishDate | 2007 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-32082011-10-18T02:37:05Z http://shdl.mmu.edu.my/3208/ Passphrase with semantic noises and a proof on its higher information rate Lee, Kok-Wah Ewe, Hong-Tat T Technology (General) QA75.5-76.95 Electronic computers. Computer science 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 2007-12 Conference or Workshop Item NonPeerReviewed 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. http://apps.webofknowledge.com/full_record.do?product=WOS&search_mode=GeneralSearch&qid=1&SID=Y2M4cogb143I6iogn9p&page=123&doc=1224 |
| spellingShingle | T Technology (General) QA75.5-76.95 Electronic computers. Computer science Lee, Kok-Wah Ewe, Hong-Tat Passphrase with semantic noises and a proof on its higher information rate |
| title | Passphrase with semantic noises and a proof on its higher information rate |
| title_full | Passphrase with semantic noises and a proof on its higher information rate |
| title_fullStr | Passphrase with semantic noises and a proof on its higher information rate |
| title_full_unstemmed | Passphrase with semantic noises and a proof on its higher information rate |
| title_short | Passphrase with semantic noises and a proof on its higher information rate |
| title_sort | passphrase with semantic noises and a proof on its higher information rate |
| topic | T Technology (General) QA75.5-76.95 Electronic computers. Computer science |
| url | http://shdl.mmu.edu.my/3208/ http://shdl.mmu.edu.my/3208/ |