The program is showing "Problems: 1" when I try to run it, but I can’t find any other output that helps identify the problem. Nothing appears in the Results directory. Any ideas?
Thanks for reporting. Either the cipher file has more than 10.000 characters/symbols, or the program can’t find the specified cipher file. Could you share it with me? It could also be a bug with the new input routine.
I’ve implemented the ability to lock letters/symbols in Examine (because you asked last time), which you can download from this thread: viewtopic.php?f=81&t=2432&p=33843#p33843 I’ve been wondering if it could be implemented with the automatic solver somehow, any suggestions?
Thanks for reporting. Either the cipher file has more than 10.000 characters/symbols, or the program can’t find the specified cipher file. Could you share it with me? It could also be a bug with the new input routine.
I get the error without changing anything. I’m just running it with the built-in ciphers and all the defaults.
I’ve implemented the ability to lock letters/symbols in Examine (because you asked last time), which you can download from this thread: viewtopic.php?f=81&t=2432&p=33843#p33843 I’ve been wondering if it could be implemented with the automatic solver somehow, any suggestions?
Perhaps a "peek" button that shows the most recent best solution. Then you can mark the letters to lock. It’d be nice to be able to type in whole words and have the corresponding underlying cipher text locked. Even better would be for a list of close dictionary matches to appear in a list as you hover over different spots in candidate plaintexts. Then you can select a word that interests you and lock it in. You could produce a list of dictionary matches by scoring them based on how well they match that spot in the cipher. Exact matches would have the best score, and other matches could be sorted by Levenshtein distance or similar.
I get the error without changing anything. I’m just running it with the built-in ciphers and all the defaults.
I fixed the problem. My Windows machine was confused about the folder I unzipped the program to. I re-unzipped to a different folder and it works now. Thanks!
I get the error without changing anything. I’m just running it with the built-in ciphers and all the defaults.
I fixed the problem. My Windows machine was confused about the folder I unzipped the program to. I re-unzipped to a different folder and it works now. Thanks!
That’s strange, it was a special folder? I just downloaded the program on all 3 of my machines and everything worked fine.
I get the error without changing anything. I’m just running it with the built-in ciphers and all the defaults.
I fixed the problem. My Windows machine was confused about the folder I unzipped the program to. I re-unzipped to a different folder and it works now. Thanks!
That’s strange, it was a special folder? I just downloaded the program on all 3 of my machines and everything worked fine.
It’s a Windows virtual machine running on my Mac. On the Mac side I had unzipped the program into a shared folder by simply opening it, causing it to automatically unzip to an AZdecrypt098 folder. On the WIndows side, I used Explorer to navigate to the shared folder, and was able to run the program but with that Problems message.
I think the problem must have been some combination of permissions and networking.
Perhaps a "peek" button that shows the most recent best solution. Then you can mark the letters to lock. It’d be nice to be able to type in whole words and have the corresponding underlying cipher text locked. Even better would be for a list of close dictionary matches to appear in a list as you hover over different spots in candidate plaintexts. Then you can select a word that interests you and lock it in. You could produce a list of dictionary matches by scoring them based on how well they match that spot in the cipher. Exact matches would have the best score, and other matches could be sorted by Levenshtein distance or similar.
These are very good ideas but mostly outside my intentions for the automatic solver. Perhaps at a later date I could start writing a new program that does just that.
Nice to know that the program is working through the VM.
Hi Jarlve..
in fact I had a solution with score >16000, but sadly saw that in the moment when I cleared it 
. Similar happened with the old tool..so a log function would have been nice, but anyway. Some thoughts on the tool which is really great:
1.) Manipulation ‘exclude’ function doesn’t work on mine. Good would be a possibilitiy to lock/include a variety of letters (e.g. all vowels aeiou or so). Same to exclude a variety of letters (e.g. the BCDFGHJKMNPQSTVXZ one position before any potential double LL letters).
2.) What does Mode 1/2 stand for? Same the FPT/Untransform/Render functions?
3.) If I replace the 5-gram file, does it lead the other data instead (e.g. dictionary) if I do rename the file?
Did some work on the :5FBc (or IoFBc) section. It consists of two trigrams repeating in line 5/13 and line 9/13. I therefore do assume that these frequent trigrams appear at least twice if not three times (with other homophones) in the cipher. Many of such trigrams do exist, though. Them to be combined is nothing else than a quintgram (or pentgram). These quintgrams, however, can be ordered according to their frequency, too. So what I did is to look for both trigrams with a frequency >3 in the 340 combined with the most frequent quintgrams consisting out of such frequent trigrams.
Following are the most frequent 403 quintgrams consisting of two trigrams with a frequency >3. Combining these with the + symbol as well as the W and the ) symbol, we can get a list of cleartext fractions such as LT_PHOTOLLTP etc. starting in line 17, with words extractable such as PHOTO. This fraction is somehow long enough to find or not find any content inside. In this case the PHOTO fractions can be ruled out (due to the LLTP nonsense), others actually do work quite well.
In fact, for each ‘+’ (e.g. letter ‘L’) this is a way to cover the most frequent varieties and at the same time reduce the cipher to a minimum. IMO it’s the first non-technical but logical approach to crack the 340. Although not perfect, it reduces billions if not trillions of varieties to a list of approximately 5,000 words that can to be found in the fraction of line 17 (by comparing with a dictionary, the Excelfunction in German is =ZÄHLENWENN(ZODIAC17;"*"&DICTIONARY&"*") with ‘dictionary’ being an intelligent table of the dictionary and ‘zodiac17’ being an intelligent table of artificially created cleartext fractions as considered above (left row quintgrams, top line AA,AB,..ZZ for W and (.
Imo the cipher in fact CAN BE SOLVED by the following method:
1. Set your ++ symbol, e.g. ‘LL’
2. Take a list of the most frequent quintgrams consisting of trigrams with frequency >3
3. Expand the cleartext artificially by the W and ) symbol (using all, AA, AB,..ZZ)
4. Define one ‘L’ symbol after another as AEIOUYWR (letters possible before LL)
5. Extract all dictionary words from all fractions for each ‘L’ symbol (done..)
6. Check out the validity of the <5000 remaining fractions individually (partially done..)
Hints:
Step 4 takes 5-10 minutes of excel calculation
Use a small dictionary instead of a large one, e.g. 5,000 words covering most of the cipher
Therefore a function in the examine tool would be cool to load a variety of quintgrams in line 13 (starting from row 9). I’ve chosen all quintgrams with a frequency of at least 2, one may also choose a bigger number (approximately 2,000 with a frequency of 1, even more if choosing a frequency expectation of e.g. 0.5). Started with the top list due to lack of computer ressources.
Maybe then the tool will find a solution immediately (as ‘ZZYGW’ is a quintgram but neither a frequent one nor are its trigrams it consists of expected to show up at least 2-3 times).
Here you see what you can get as a cleartext in line 17, which is quite a long text to read/analyze:
BTW, ‘HOUGH’ is a nice one (frequent quintgram of frequent trigrams) as it is very frequent and connects with the + symbol to ‘ALTHOUGH’..
QT
WHICH
ATION
OUGHT
HEHAD
EOFTH
EVERY
HOUGH
THOUG
COULD
FORTH
ITHTH
RINCE
SOFTH
UNDER
TOFTH
HECOU
HOULD
OTHIN
SHOUL
TIONS
EDHIM
ESAID
ITHOU
NTOTH
WITHO
YTHIN
EANDT
SANDT
SHEHA
ULDNO
EDINT
FTHES
NCEAN
SHEWA
STILL
THOSE
THOUT
BUTTH
DTOTH
INTER
INTOT
UGHTH
ATTER
ECOUL
HEART
HINGT
NDERS
ONEOF
SSION
TERTH
TIONT
TTHES
VERTH
EDTOT
FTHEC
FTHEM
HADNO
HECON
HEMAN
HESAI
ISHED
RESSI
SHALL
TERED
TTHEM
TTHEY
AINED
ECOUN
ERSEL
ERYTH
HANDS
HEARD
HIMAN
OUTTH
OVERT
RINGT
STHEY
TANDT
DANDT
EARTH
ENERA
TINGT
FTHEP
HESTR
NCEOF
NEDTO
NINGT
OTHES
OUNTE
OUTOF
SANDS
STHES
BLETO
DERTH
EMAIN
SHESA
TEDTO
TTHEC
EANDS
ERSTA
ETOTH
EWASS
GHTTH
HEWHO
HINGA
NCESS
TANDI
DERED
DNOTH
ITHIN
NDERT
ONTIN
OUNDE
REDTO
STRAN
DINGT
EANDA
ECOME
ERSAN
ESSAN
FTHEF
FTHEI
HEHOU
INESS
ISHEA
OUSAN
RANDT
REALL
SANDA
TANCE
WEREA
CONCE
EARED
EHAVE
EWAST
GHTOF
HEHEA
HESTA
ATHEW
DANDS
EANDI
EDATT
EDONT
EHEAR
EROFT
ERSHE
ESSIN
ESSOF
ESTIO
EVERA
FTHET
HESHO
ICHTH
ISHAN
MENTO
NGTOT
OUNDT
RANCE
RTHES
STATE
STHEM
STHOU
STOTH
TEDHI
TINGA
TTHEP
WERET
IGHTH
OTHEC
STION
TEDAN
TTHEF
ASSHE
EARIN
EASAN
EATTH
ERSTO
ESSTH
EVERT
FTHEW
HECOM
HETHO
IONTO
NDSHE
ONEAN
REATE
RTHAN
SHEDI
SINCE
STHEC
TANDS
TERIN
THOUS
WERES
AIDHE
FORET
FTHED
HTHES
LEAVE
NTOFT
OTHEM
RTHEM
SHECO
STANT
AIDTO
ATEVE
DINTO
EATED
ECONT
EDOUT
ERINT
FRONT
FTHEH
GHTAN
GTHEM
HESTO
HICHA
ISHOU
MANDE
NINGA
ORTOF
OUNDA
REDAN
SHOUT
TTHEN
TTHET
WERED
BLEAN
EDONE
ENEDT
ERSTH
FTHEA
HEFOR
INEDT
ISTAN
OTHEP
SANDI
SHEDT
TEDIN
ENEVE
EVERS
FTHEL
GHTER
HECHA
ITHAN
NDINT
NOTTH
OTHED
RANDS
RINGA
SAINT
STHEF
TANDA
TERAN
TERES
TTERS
TTHED
TTHEI
TTHEW
ASTER
AVERY
DANDA
EARAN
ESTIN
HEYOU
NDALL
OMETO
OUNDS
REARE
RTHEC
RTHEL
STERS
STHEP
TINTO
VERED
WHOSE
YTHES
AREDT
ATEDT
ATHEH
ATIST
DHERS
ECONS
EHEHA
ERIGH
ERSOF
HANDT
IONIN
ISTIN
NTEDT
ONSOF
OUTIN
REATH
RTHEF
STHEN
STONE
ASTHO
ATHAD
CONTE
DHISH
ERSIN
FORES
HEDAN
ITHAD
NDSAI
NEDAN
NTESS
OFTHO
OUTAN
RTHEY
SINGT
STENE
TTERI
TTHEL
TTHIN
AININ
DERIN
EHEWA
EMATT
ESSHE
GHTIN
GTHES
HANDA
INTED
MANDT
NGATT
OMEAN
OTHEL
RANDA
RESTO
RTHEP
SHORT
TTERT
ANTIN
ASSIN
ATEDA
EANIN
EDATH
HTHEM
TEDHE
ANTED
ARTER
AVERT
EINTE
ERALL
ERYOU
NCETO
NDERI
NDEVE
NEDHI
ONSAN
OREHE
ORTAN
OTHEF
OTHEI
OUNDI
REDHI
REDIN
RESTI
SHAVE
SHEAR
SHEDA
SSIST
START
STERI
TTHEH
VERAN
HEDTO
LEAST
STHEL
TTHEA
ARTED
DANDI
DINGA
EANOT
EDIST
EINTO
ERATI
ESEEN
ESTAN
ESTED
ESTOF
EVERI
FTHEN
HADTO
HTHEC
HTHEI
INEVE
ISHIN
NDEDT
NEDIN
ONEHA
ONETO
OREAN
OTHEW
OVERA
RTHEI
RTHEN
STHEW
STOFT
TIONE
ULDER
YTHEY
*ZODIACHRONOLOGY*
Hey Quicktrader,
1) If set to exclude selected squares will become red and those will not be submitted to the solver. Can be used to exclude rows, columns if you click on the row or column number. You can also select normally (green selection) and press the delete-key and then the r-key. This will delete a selection and also remove the empty place it left. To clear any selection use the c-key.
2a) Mode 1: character. Just selected one character at a time. Mode 2: symbol. Select all characters with the same symbol (useful if you want to select all "+" symbols at once).
2b) FPT stands for free path tool. It allows you to (un)transposition a cipher, and the result is automatically fed into the solver as you go. It’s a bit complicated and unwieldy. I made a small guide in: viewtopic.php?f=81&t=2432 (my first post).
3) You can use other n-gram files but they need to be in the same format. So no dictionaries.
I don’t fully understand the system/method you are describing but good luck with it. Well it seems you want to exploit the possible 1:1 substitute "+" symbol in the cipher. That’s not a bad idea. You can lock the symbol to the letter "l" and work your way from there. About character n-grams, a 5-gram could consist of up to three 3-grams.
Therefore a function in the examine tool would be cool to load a variety of quintgrams in line 13 (starting from row 9). I’ve chosen all quintgrams with a frequency of at least 2, one may also choose a bigger number (approximately 2,000 with a frequency of 1, even more if choosing a frequency expectation of e.g. 0.5). Started with the top list due to lack of computer ressources.
How does this functionality need to behave exactly? Can’t promise I will add it.
The solver assigns letters to symbols and then uses 5-grams to score the resulting text, if it’s an improvement it keeps the change and otherwise it discards it.
Hey Quicktrader,
1) If set to exclude selected squares will become red and those will not be submitted to the solver. Can be used to exclude rows, columns if you click on the row or column number. You can also select normally (green selection) and press the delete-key and then the r-key. This will delete a selection and also remove the empty place it left. To clear any selection use the c-key.
HI…DID NOT MEAN TO EXCLUDE SYMBOLS BUT ALPHABETICAL LETTERS, E.G. FOR THE + SYMBOL NOT TO USE LETTERS SUCH AS Q,Z,Y,..THEREFORE INCLUDING/EXCLUDING CERTAIN LETTERS FOR EACH SYMBOL, IF REQUIRED (AS IT REDUCES THE AMOUNT OF VARIETIES, MAY THUS INCREASE THE CHANCE TO RECEIVE A SOLUTION).
2a) Mode 1: character. Just selected one character at a time. Mode 2: symbol. Select all characters with the same symbol (useful if you want to select all "+" symbols at once).
NICE
2b) FPT stands for free path tool. It allows you to (un)transposition a cipher, and the result is automatically fed into the solver as you go. It’s a bit complicated and unwieldy. I made a small guide in: viewtopic.php?f=81&t=2432 (my first post).
3) You can use other n-gram files but they need to be in the same format. So no dictionaries.
FORMAT SUCH AS? WITH NUMBERS ON IT OR SIMPLY A .TXT FILE?
I don’t fully understand the system/method you are describing but good luck with it. Well it seems you want to exploit the possible 1:1 substitute "+" symbol in the cipher. That’s not a bad idea. You can lock the symbol to the letter "l" and work your way from there.
THAT’S EXACTLY WHAT I AM GOING FOR.
About character n-grams, a 5-gram could consist of up to three 3-grams.
IT INDEED DOES, BUT ONLY TWO OF THEM ‘TOUCH’ EACH OTHER IN ONE 5-GRAM AND REPEAT TWICE IN THE CIPHER (EACH). THIS IS WHY I´D LIKE TO PLACE A LIST OF THE MOST FREQUENT E.G. 200 5-GRAMS INTO THIS SPECIFIC AREA OF THE CIPHER.
ALSO SAW THAT THE 5-GRAM LIST IS A COMPLETE ONE, AAAAA TO ZZZZZ, IT MIGHT BE USEFUL TO MODIFY IT TO E.G. THE 10,000 MOST FREQUENT 5-GRAMS.
Therefore a function in the examine tool would be cool to load a variety of quintgrams in line 13 (starting from row 9). I’ve chosen all quintgrams with a frequency of at least 2, one may also choose a bigger number (approximately 2,000 with a frequency of 1, even more if choosing a frequency expectation of e.g. 0.5). Started with the top list due to lack of computer ressources.
How does this functionality need to behave exactly? Can’t promise I will add it.
The solver assigns letters to symbols and then uses 5-grams to score the resulting text, if it’s an improvement it keeps the change and otherwise it discards it.
THANKS
QT
*ZODIACHRONOLOGY*
HI…DID NOT MEAN TO EXCLUDE SYMBOLS BUT ALPHABETICAL LETTERS, E.G. FOR THE + SYMBOL NOT TO USE LETTERS SUCH AS Q,Z,Y,..THEREFORE INCLUDING/EXCLUDING CERTAIN LETTERS FOR EACH SYMBOL, IF REQUIRED (AS IT REDUCES THE AMOUNT OF VARIETIES, MAY THUS INCREASE THE CHANCE TO RECEIVE A SOLUTION).
I have experimented with such things (like assigning letters randomly biased by their frequency) but it did more bad than good. The hill climber needs freedom to move things around, things need to flow, constrictions interrupt the flow. The exploration aspect.
FORMAT SUCH AS? WITH NUMBERS ON IT OR SIMPLY A .TXT FILE?
Exactly the same format as the n-gram files the program comes with. ABCDE frequency.
ALSO SAW THAT THE 5-GRAM LIST IS A COMPLETE ONE, AAAAA TO ZZZZZ, IT MIGHT BE USEFUL TO MODIFY IT TO E.G. THE 10,000 MOST FREQUENT 5-GRAMS.
It’s not complete but the quality is rather high, source: http://practicalcryptography.com/
It is not a good idea to use a limited n-gram list because this will make the search space less smooth, introduce more gaps/etc. My program uses an algorithm close to simulated annealing and it’s known to work best when the search space is smooth.
You want to place a custom list of 5-grams in a specific area of the cipher. But this would also fill in all the associated symbols right?
I think you’re looking for a non-optimal solution in the 340, which could be the reason why our solvers don’t get it. So any solver will basicly work against you unless it’s engineered from to ground up to your specifications.
What were the (or were there) test results for Playfair?
There was a link for "Playfair encipherment prior to homophonic substitution"
But it no longer works.
What were the (or were there) test results for Playfair?
There was a link for "Playfair encipherment prior to homophonic substitution"
But it no longer works.
I’m quite certain that you mean my post at http://www.zodiackillerfacts.com/forum/ … 902#p20902
Which does no longer exist. Unfortunately, I did not save this work, and I quite honestly don’t recall exactly what I did. However. I am certain that the 340 is NOT a Playfair cipher, homophonically enciphered.
I wish that every single post of mine at zodiackillerfacts.com had not been deleted, but they have been. Far out of my control.
Not really a big deal, since that entire board is now as dead as buried bones. If it vanished, no one would even notice.
-glurk
——————————–
I don’t believe in monsters.
