0
An Algorithmic Solution of Sequential Homophonic Ciphers
John C. King, Dennis R. Bahler, 1993. Cryptologia 17(2): 148–165.
Presents REMOVE_HOMOPHONES, an algorithm that finds sets of homophones in an unspaced ciphertext and reduces a sequential homophonic cipher to simple substitution without relying on frequency analysis.
What it's used for here
The mixed-keys survey cites it for detecting and collapsing cyclic homophones; it also appears in the book's bibliography.
Cited by on this site 2 records
Reading Without a Key
SRCThe book, version 2.0
1 methods surveys
SRCMixed keys
Cite it
King, J. C., & Bahler, D. R. (1993). An Algorithmic Solution of Sequential Homophonic Ciphers. Cryptologia, 17(2), 148–165. https://doi.org/10.1080/0161-119391867827
@article{kingbahler1993,
author = {King, John C. and Bahler, Dennis R.},
title = {An Algorithmic Solution of Sequential Homophonic Ciphers},
journal = {Cryptologia},
year = {1993},
volume = {17},
number = {2},
pages = {148--165},
doi = {10.1080/0161-119391867827}
}TY - JOUR TI - An Algorithmic Solution of Sequential Homophonic Ciphers AU - King, John C. AU - Bahler, Dennis R. PY - 1993 JO - Cryptologia VL - 17 IS - 2 DO - 10.1080/0161-119391867827 SP - 148 EP - 165 ER -
King, John C. and Dennis R. Bahler. “An Algorithmic Solution of Sequential Homophonic Ciphers.” Cryptologia 17, no. 2 (1993): 148–165. https://doi.org/10.1080/0161-119391867827.