Editing
Cipher Cracking 2012
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Supervisors == *[[Derek Abbott|Prof Derek Abbott]] *[[Matthew Berryman|Dr Matthew Berryman]] ==Honours students== * [[Thomas Stratfold]] * [[Aidan Duffy]] ==Project guidelines== *[http://www.eleceng.adelaide.edu.au/personal/dabbott/project_handbook_2009.pdf Project Handbook] ==General project description== In this project you will attempt to solve a possible murder that took place in Adelaide in 1948. This crime remains unsolved till today, but you can use engineering to bring our knowledge closer to the killer. You can read the details about the dead body and the circumstances [http://en.wikipedia.org/wiki/Taman_Shud_Case] Associated with the dead body was this secret code: :MRGOABABD :MTBIMPANETP :MLIABOAIAQC :ITTMTSAMSTGAB (See the original photograph, as there may be an extra line, and some of the M's may be W's. Some people also think that the last "I" is really a "V". Also the last G is probably really a C). To this day code crackers have been unable to decrypt it. We also want you to bring the skills of an electrical engineer to bear on the area of e-forensics and see if you can apply these to other areas of the case (eg. graphical reconstruction of the dead man's face). ==Specific tasks== * Critically review the statistical analysis of the letters. See if you can extend it (eg. testing another language previous students missed and checking if they included all possibilities of ambiguous letters). Is the conclusion of previous team correct? * Extend the [[Media:Cipher GUI.rar|CipherGUI 2011]] software that was created by the previous team. See if you can add more ciphers to the collection. Use it to eliminate more ciphers and enter your conclusions here: [[Cipher Cross-off List]]. Be critical and be prepared to question and recheck some of the items already on the list. * Create a proper web interface for the web crawler that was written last year and make it easier to use. See if you can run it and get a few example string matches. * Because the web crawler would take years to trawl the web, write another interface that searches pre-indexed web data. Talk to the comp. sci. department to find sources of user-accessible indexed web data. * Use computer graphics to reconstruct and undistort the face of the dead man. What would he look like if he were alive? To do this you need to buy a [http://www.david-laserscanner.com/ 3D scanner] and scan in the man's face from a plaster bust that is in a museum. An example of the type of graphics software you can use to manipulate the scanned image is [http://www.123dapp.com/catch 123D]. * Create an entertaining YouTube video of your whole project. == Weekly progress and questions == This is where you record your progress and ask questions. Make sure you update this every week. *[[Cipher cracking 2012 weekly progress]] ==Useful notes== As useful bits of information come to light, just list them here: * ==Approach and methodology== We expect you to take a structured approach to both the validation of last year's results, and the writing of the software. You should carefully design the big-picture high-level view of the software modules, and the relationships and interfaces between them. Think also about the data transformations needed - you will start off with html web pages, and in the end will need some matlab graphs. ==Possible extension== If you knock off this project too easily and are looking for a harder code cracking problem to try your software out on, you can progress to analyzing another famous unsolved mystery: the [http://en.wikipedia.org/wiki/Voynich_manuscript Voynich Manuscript] == Expectations == We don't really expect you to find the killer, though that would be cool if you do and you'll become very famous overnight. To get good marks we expect you to show a logical approach to trying to find the patterns from the code on the web, and any other attempts to crack the code. Running the webcrawler for many hours is unrealistic, but we would like you to run it for short bursts to find some examples of the type of matches it comes up with. == Relationship to possible career path== Whilst the project is fascinating as you'll learn about a specific murder case—and we do want you to have a lot of fun with it—the project does have a hard-core serious engineering side. It will familiarize you with techniques in information theory, probability, statistics, encryption, decryption, and datamining. It will also improve your software skills. The project will also involve writing software code that trawls for patterns on the world wide web (exploiting it as a huge database). This will force you to learn about search engines and databases; and the new tools you develop may lead to new IP in the area of datamining and also make you rich/famous. The types of jobs out there where these skills are useful are in computer security, comms, or in digital forensics. The types of industries that will need you are: the software industry, e-finance industry, e-security, IT industry, Google, telecoms industry, [http://www.asio.gov.au/ ASIO], [http://www.asis.gov.au/ ASIS], defence industry (e.g. [http://www.dsd.gov.au/ DSD]), etc. So go ahead and have fun with this, but keep your eye on the bigger engineering picture and try to build up an appreciation of why these techniques are useful to our industry. Now go find that killer...this message will self-destruct in five seconds :-) ==See also== * [[Final Report 2012]] * [[Semester A Progress Report 2012]] * [[Cipher Cross-off List]] * [[Media:Cipher GUI.rar|CipherGUI 2011 (Download)]] * [[Web Crawler 2011|Web Crawler 2011 (Download)]] * [http://youtu.be/Zd8gQDM43iI 2012 Final Seminar (YouTube)] * [http://www.youtube.com/watch?v=bmorbe01mTA The scanning process (YouTube)] * [http://youtu.be/SEAo4pt-JHU The fusion process (YouTube)] * [http://youtu.be/vzijH9zGmXE The final model (YouTube)] * [http://youtu.be/jWE7xl9LiOw Code Cracking: Who Murdered the Somerton Man? 2012 (YouTube)] * [[Timeline of the Taman Shud Case]] * [[List of people connected to the Taman Shud Case]] * [[List of facts on the Taman Shud Case that are often misreported]] * [[List of facts we do know about the Somerton Man]] * [[The Taman Shud Case Coronial Inquest]] * [[Letter frequency plots]] * [[Structural Features of the Code]] * [[Markov models]] * [[Primary source material on the Taman Shud Case]] * [[Secondary source material on the Taman Shud Case]] * [[Transition probabilities from selected texts]] * [[Listed poems from The Rubaiyat of Omar Khayyam]] * [[Using the Rubaiyat of Omar Khayyam as a one-time pad]] * [[Using the King James Bible as a one-time pad]] * [[Using the Revised Standard Edition Bible as a one-time pad]] * [[Transitions within words]] == References and useful resources== If you find any useful external links, list them here: * [http://en.wikipedia.org/wiki/Taman_Shud_Case The taman shud case] * [http://www.library.cornell.edu/colldev/mideast/okhym.htm Edward Fitzgerald's translation of رباعیات عمر خیام by عمر خیام] * [http://ebooks.adelaide.edu.au/ Adelaide Uni Library e-book collection] * [http://www.gutenberg.org/wiki/Main_Page Project Gutenburg e-books] * [http://onlinebooks.library.upenn.edu/archives.html#foreign Foreign language e-books] * [http://www.ohchr.org/EN/UDHR/Pages/Introduction.aspx UN Declaration of Human Rights - different languages] * [http://www.eleceng.adelaide.edu.au/personal/dabbott/tamanshud/SSC_mckay1999.pdf Statistical debunking of the 'Bible code'] * [http://enc.slider.com/Enc/OneTimePads One time pads] * [http://www.fbi.gov/hq/lab/fsc/backissu/jan2000/olson.htm Analysis of criminal codes and ciphers] * [http://www.fbi.gov/hq/lab/fsc/backissu/april2006/research/2006_04_research01.htm Code breaking in law enforcement: A 400-year history] * [http://portal.acm.org/citation.cfm?id=1389095.1389425 Evolutionary algorithm for decryption of monoalphabetic homophonic substitution ciphers encoded as constraint satisfaction problems] ==Back== *[https://myuni.adelaide.edu.au/webapps/portal/frameset.jsp Back to MyUni] *[http://www.eleceng.adelaide.edu.au/personal/dabbott Back to Derek Abbott's homepage] *[http://www.eleceng.adelaide.edu.au Back to EEE Department page] *[http://www.adelaide.edu.au Back to the University of Adelaide homepage] *[https://www.eleceng.adelaide.edu.au/personal/dabbott/wiki/index.php/Cipher_Cracking_2012 Back to Cipher Cracking 2012 homepage]
Summary:
Please note that all contributions to Derek may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Derek:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information