This 2-sentence ciphertext was generated by my random con generator. The text is from gutenberg.org. My program diagnosed it as fractionated Morse and my hill-climber solved it in 1.57 seconds. I’m not going to provide a crib since I think it’s not necessary
Here’s a randomly generated cipher of unknown type. All my ID tests put the correct type on top. A hill-climber solved it without a crib but I’ll include a caesar-shifted crib.
HGOHW NTTTE FFSBI KKQHQ ATCII ZKVZQ MMQAW ABGRA NKLNE REOXL NWENI
FFQBX DVWDO SPFEA GYRUR ZPPVJ GNRQR VVEUC LOAUM IWYIR MUOOP KLSBL
PSVMK TXZJI BXAAY SBNJR FKI.
Two ciphers today!
Here’s a randomnly generated Gromark cipher. As usual none of my ID tests put Gromark on top. My PH hill-climber solved it without the primer and without a crib. I’ll add primer and crib in caesar-shifted form.
LZJPB ZLFQQ UVTIU OVDBQ MIIDE TULWG ZIBRA QKLGZ GFPPR BJCYM TWVZZ
CYZVS DGZPR HLROJ YRUAE SSQAE NROKE RZAPH RGPSR CODFM HUNBO AHOJG
caesar_shifted primer: EJWTXNCYBTYBTKNAJ
caesar-shifted crib: SMTSJXYRFS
FMTMT QQFFG EQFUU NUUGL UWFGS NSQQN YPLFE QSWFP ZGPLX QVVCM UDRNZ GBWHS LNVOQ VVCEN HSQSI VGKYF SQGOP XWFPY LOC
This con is a randomly selected sentence from the Internet. My Analyzer placed the correct cipher type in 17th place! My hill-climber solved it without a crib, but I am including a Caesar-shifted crib: HUKOVWL. Correction: The first sentence was too short, so my program selected the beginning of another sentence to lengthen it. The second sentence is truncated in the middle of a word.
Here’s a randomly generated cipher of unknown type. Two of my ID tests put the correct type on top and one put it in second place. A hill-climber solved it quickly.
ISONG SAUHO NISOP MCNCN MYGOT APOCE GUULS NEODN DBEEE LKBYE NAIKR
VINBO BNLFT TTNLP GSETL GTEST OETNR IEEOI LDSRE MNOTN YFEOM EDYRS
AEREN TACOO RFOKA HEVAT NENHH EETIH HEGAR AVDUK AAENS S.
TEMOIS HNSM CSPNHSOIIOM SPO SONN NSM SHIN SPO NONSSIHN OCEOS ES SPO SHISS IS SPO WNIS SIIS SIMMOH SIH SPO PIHIOI SPOS SIIIOM CNIS SPO THNII N ONT IS NONO N NEOWO IS ONWIS NSM N SHGEST NNS
This is a random quote from gutenberg.org. The key is also from a random sentence in gutenberg and the final word is truncated. I was able to solve it using computer-assisted word searches by patterns.
I was toying with some ideas and noticed that it is possible to create a word pattern based on the frequency of the letters. It works by comparing the normal frequency of each letter in the word with the other letters and numbering them in order of most frequent to least, with duplicate letters given sequential numbers, not repeats. For example CHASTENED gets the pattern 974631528. E being the most frequent letter, the first E gets the 1, the second E the 2, then T, and so on. For words longer than 10 letters, using the alphabet instead of numbers would be necessary. It could also be done using repeats, like Myszkowski, so both E’s would get the 1 in the example.
I’ve noticed that for shorter words there are many duplicates, i.e. words with the same pattern, but for longer ones, there are relatively few. For words over seven letters long, many have unique patterns. So far I have not found a use for these patterns in solving, but it seems like there should be one. These patterns could be useful for an Aristocrat in finding a long word if the ciphertext was long enough enough to have reliable frequency data, I suppose, but there are much easier ways of solving those. It seems like the patterns might be used somehow in those types with word breaks like Ragbaby or Sequence.
If anyone has any ideas on how to use these patterns please post your comments. I can provide a sample pattern list for words of length 3 to 9 if you contact me.
Here’s a randomly generated cipher of unknown type. Two of my ID tests put the correct type on top and one ID test put it in second place. Both a key search and a hill-climber solved it quickly with no crib. I added the “NeDB” database program (written for node.js) to my generator so the cipher was saved in json format to my new random cipher database file.
AEMBE FLAER HAAIH PLRSC SPTFD IOLBT NHROR NEAHT SAEPI NUCEE TTTIY
VRGOT ARBYT NPLOO OSSEE YNSER IDYAA WIOUM MSOTO CLMAO REEMU ALEOE
ETFST HOATA BVTIR OHWAI RAUTE RORNI NLRGO EOFTN ULDSS EIRAE ETGAE TOEHL DNETS OROTE ANAAT EHOLM IEASE EERHO HERFT NOHIS WEEOT ANRSE THTEF CASDM EASNS FTRSP P
The plaintext is randomly chosen from Gutenberg.org. The type and key are randomly chosen by my program. My analyzer placed the correct type in 7th place. My programs had trouble solving it, but I eventually solved it with my hillclimber using the crib. The crib in Caesar is LWFSIRJXFNS
Here’s a cipher of unknown type. Two of my ID tests put the correct type on top, but the other test put it fifth on the list. Key search and PH hill-climbing both solved it without a crib. I’ll add a caesar-shifted crib.
HLASX IUCZQ STEHO AKADN AIGSQ XAMYM UHDZT RAPFL DLSLP RAPQX XPKIX
BHTPL YICUY HPRSU RAPER XIMKO XHBAR QTSAZ YRCRN AULUN VNSKT YPR.