CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Terms of use
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "difficulty of mob cipher"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange This and that Topic #700
Reading Topic #700
alexbadmin
Charter Member
1820 posts
Apr-12-06, 10:41 AM (EST)
Click to EMail alexb Click to send private message to alexb Click to view user profileClick to add this user to your buddy list  
"difficulty of mob cipher"
 
   I got a message which I'd like to respond to, but have no idea how. I can imagine that the codes were completely random, in which case they could not be possibly "deciphered" except via context identification. The message follows.

Dear Prof. Bogomolny,

My name is Rossella Lorenzi; I'm a journalist. I am writing a news story on the arrest of the Mafia's top boss, Bernardo Provenzano for Discovery Channel's web site (www.discovery.com)

As you might have read, the Mafia boss spent most of his time typewritting his orders on small sheets of paper using an obsolete Olivetti 32 typewriter.

The sheets of papers feature the "Provenzano code" -- a code made of
number sequences which the Mafia boss developed during decades on the run.

Here is an example:

"I got in touch with 10122341, and met 512151522, we have agreed to meet after the holidays, some people talked of big numbers, I am talking of 1316942016".

Another sheet of paper: "Ciao Papa. Ps. A good bye from 3251665212".

I'd like to add your authoritative comment.... what do you think of this code? Would it be easy to decode?

I'd be very thankful if you replied as soon as possible, as I have
a very very tight deadline.

Many thanks for your time and help.

Sincerely,
Rossella Lorenzi

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Rossella Lorenzi
Independent Science Journalist
Correspondent, Discovery News
Via A. Caro 44
50142 -- Florence -- Italy
email: lorenzi@tin.it
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
mr_homm
Member since May-22-05
Apr-12-06, 11:59 PM (EST)
Click to EMail mr_homm Click to send private message to mr_homm Click to view user profileClick to add this user to your buddy list  
1. "RE: difficulty of mob cipher"
In response to message #0
 
   Alex,

My take on this is that it is probably not a true cipher (defined to be a letter by letter substitution). If it were, then with enough examples, the letter substitutions can be deduced. Especially, for instance, some of the code words are obviously people, and since many Italian names end in the letter "a", the last number substitution in these codes would probably stand for that letter.

If it is a whole-word substitution code, then there is much less chance of cracking it. It would still be possible, but one would need a great deal of external contextual information. If most of the code words refer to people, then the messages could be correlated in time with any known activities of other mob figures. However, for that to be effective, one would need an extensive collection of these messages, correctly dated. If this is not available, correlation with outside context would be nearly impossible.

A related consideration is this: How did his confederates know what the codes stood for? There are really only two possibilities: a "codebook" was distributed initially with word-number correspondences (and perhaps updated from time to time) or the code is generated algorithmically somehow, and both he and the recipients of his messages know the algorithm.

In the first case, the code is pretty nearly unbreakable without the codebook. This method was standard in espionage through WWII, and its only weakness is the vulnerability of the codebook to interception. There are two types of codebook, a single use codebook, where each page is discarded after use, or a reusable code. The first one is more secure, since if the code is broken for one page, the next message will still be unreadable, but the codebooks need to be replaced from time to time, which means personal contact or a drop-off, which are activities vulnerable to discovery. The reusable codebook does not have this trouble, but once the code is broken, all messages become readable until a new codebook can be issued.

In the second case, the code is inherently breakable given enough samples, because there must be some algorithmic method involving the letters of the word being encoded, which generates the code. However, if the code is very complex, the number of samples needed would be very high. The advantage of this method is that there is no vulnerable codebook, but one must take care not to let too many messages be intercepted. (As an interesting side-note, the famous Enigma machine used in WWII was an attempt to combine the advantages of both methods. Essentially, it was a machine for algorithmically generating single-use codes. With this system, one does not need to send out codebooks periodically, and one still has the security of a code that changes with each message. Alan Turing and company eventually cracked this code by deducing the algorithm that changed the code, enabling them to predict the next codebook page.)

One way to determine which type of code he was using is to look at his behavior after he was in custody. Clearly, he would not be allowed to keep a codebook on his person, and we can assume that no such book was found (otherwise, we would know already how to read his messages). If, after he was in custody, he was found trying to send a coded message, this would prove that he was NOT using single-use codebook, as in that case he would not know how to encode his message. The possibilities are only two: either he was using algorithmic encoding, or he had a standard reusable codebook, which he had memorized after years of use. The second possibility is very unlikely, since the codebook must be small enough to memorize, but at the same time, it must contain codes for a fixed list of commonly used words, such as names of other mob members, common activities, etc. It is hard to see how a list short enough to memorize would be comprehensive enough to be useful. But perhaps he has a very good memory!

On the other hand, if after he was in custody, he made NO attempt to send any coded messages, then there would be (weak) evidence that he was using an extensive codebook. In this case, the next thing to look for is whether the code referring to the same person ever changed. If two different messages can be proven (through external context) to refer to the same person, and yet the code numbers are different in the messages, then the code is periodically changing, and so he is either changing the algorithm or issuing new codebooks.

Which case is the truth depends on what he is observed to do, which at this point we do not know.

One final possibility occurs to me: It is always possible that the numerical code is a misdirection. Perhaps the real content of the message is hidden in the plain text portion. Perhaps merely including a PS is a signal, perhaps the word "goodbye" indicates that some job is accomplished, or perhaps Papa stands for a specific place or time, etc. There are many, many possibilities with this kind of word-substitution code, and it is very nearly impossible to crack. It'suffers very much from having a fixed and very limited vocabulary of encodable concepts. If he doesn't have many different types of things to say, or many different instructions to issue, then perhaps he could use such a code.

--Stuart Anderson


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
alexbadmin
Charter Member
1820 posts
Apr-13-06, 06:47 AM (EST)
Click to EMail alexb Click to send private message to alexb Click to view user profileClick to add this user to your buddy list  
2. "RE: difficulty of mob cipher"
In response to message #1
 
   Stuart, thank you.

I'll pass your post on. Perhaps one day we'll know the manner in which the number string have been produced and whether the rest of the sentence had a coded meaning. My gut feeling is that the process of translating the mob correspondence will be more like a feat of deciphering Egyptian hieroglyphs rather than RSA code breaking.

Alex


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
alexbadmin
Charter Member
1820 posts
Apr-17-06, 11:19 AM (EST)
Click to EMail alexb Click to send private message to alexb Click to view user profileClick to add this user to your buddy list  
3. "RE: difficulty of mob cipher"
In response to message #1
 
   I understand that Rossella found that a couple of number sequences become meaningful when treated with the Ceasar (+3) filter. Some do not. But this is the direction she plans to follow up.


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

|Front page| |Contents|

Copyright © 1996-2018 Alexander Bogomolny

Search:
Keywords:

Google
Web CTK