{"id":3148,"date":"2015-08-15T04:45:58","date_gmt":"2015-08-15T04:45:58","guid":{"rendered":"http:\/\/www.hexacorn.com\/blog\/?p=3148"},"modified":"2015-08-15T04:47:24","modified_gmt":"2015-08-15T04:47:24","slug":"cryptarithms-sort-of-dfir-related","status":"publish","type":"post","link":"https:\/\/www.hexacorn.com\/blog\/2015\/08\/15\/cryptarithms-sort-of-dfir-related\/","title":{"rendered":"Cryptarithms (sort of DFIR-related ;))"},"content":{"rendered":"<p>Last year I was looking at my very old programs and I came across a cryptarithm solver that I wrote in khem&#8230; Pascal. I wrote it to solve one such riddle published in a crossword magazine back in a day (as a side note: when I found it I was actually looking for something completely different in a first place \/as it is usually the case\/).<\/p>\n<p>As per <a href=\"https:\/\/en.wikipedia.org\/wiki\/Verbal_arithmetic\">wikipedia<\/a>: cryptarithm or word addition, is a type of mathematical game consisting of a mathematical equation among unknown numbers, whose digits are represented by letters. The goal is to identify the value of each letter.<\/p>\n<p>Since I came across it I started wondering if there was a generic solution for this type of puzzle and after googling around I found out that it is possible &#8211; some people created dedicated web sites that handle all the solving work for you.<\/p>\n<p>Using these available tools I created these 2 below so if you are bored, you can try to solve them \ud83d\ude09 [as you can see it is DFIR-related \ud83d\ude09 ]<\/p>\n<ul>\n<li>RCE+DFIR=ELEET<\/li>\n<\/ul>\n<pre>       \u00a0 RCE\r\n      + DFIR\r\n       ----- \r\n     = ELEET\r\n<\/pre>\n<ul>\n<li>MFT+FILE+FILE+FILE+FILE=NTFS<\/li>\n<\/ul>\n<pre>          MFT\r\n       + FILE\r\n       + FILE\r\n       + FILE\r\n       + FILE\r\n       ------\r\n       = NTFS\r\n<\/pre>\n<p>And if you struggle you can always cheat and use this <a href=\"http:\/\/bach.istc.kobe-u.ac.jp\/llp\/crypt.html\">solver<\/a> by Naoyuki Tamura (that&#8217;s how I created these anyway \ud83d\ude42 )<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Last year I was looking at my very old programs and I came across a cryptarithm solver that I wrote in khem&#8230; Pascal. I wrote it to solve one such riddle published in a crossword magazine back in a day &hellip; <a href=\"https:\/\/www.hexacorn.com\/blog\/2015\/08\/15\/cryptarithms-sort-of-dfir-related\/\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[36,18],"tags":[],"_links":{"self":[{"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/posts\/3148"}],"collection":[{"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/comments?post=3148"}],"version-history":[{"count":3,"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/posts\/3148\/revisions"}],"predecessor-version":[{"id":3151,"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/posts\/3148\/revisions\/3151"}],"wp:attachment":[{"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/media?parent=3148"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/categories?post=3148"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.hexacorn.com\/blog\/wp-json\/wp\/v2\/tags?post=3148"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}