Ttdfjt

How much can I judge a company based on a phone screening?

Why aren’t there water shutoff valves for each room?

Is there a SQL/English like language that lets you define formulations given some data?

The cat exchanges places with a drawing of the cat

(A room / an office) where an artist works

A continuous water "planet" ring around a star

How far did Gandalf and the Balrog drop from the bridge in Moria?

What is the difference between 王 and 皇?

Why did IBM make public the PC BIOS source code?

How would timezones work on a planet 100 times the size of our Earth

How would you translate this? バタコチーズライス

How do I call a 6-digit Australian phone number with a US-based mobile phone?

Is there any way to stop a user from creating executables and running them?

Are those flyers about apartment purchase a scam?

Do beef farmed pastures net remove carbon emissions?

Are there really no countries that protect Freedom of Speech as the United States does?

PhD advisor lost funding, need advice

Word for an event that will likely never happen again

What would it take to get a message to another star?

Beginner in need of a simple explanation of the difference between order of evaluation and precedence/associativity

How to remove ambiguity: "... lives in the city of H, the capital of the province of NS, WHERE the unemployment rate is ..."?

Markov-chain sentence generator in Python

How can I communicate my issues with a potential date's pushy behavior?

Telephone number in spoken words

Secret message 01

Help me break my friend's code!A keyword in a riddle - Find the cypher-keyword and crack the messageLolcat Steganography: Find the message hidden within the transport medium of humorous feline photographyWhat does this random string of sentences mean?Weird messages from a friendWhatever it is, it should be in a museumMy brother and his cipherA bouncer named BobAbsent Employee's PasswordWord Search Cipher

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;

3

$begingroup$

116313333134261542156511321455121126113213151461123615112516114142

OK, so recently I made up a way of sending coded messages and I was just wondering how difficult it would be for someone to crack.
So let's say, for example, that you are in the army and you caught a suspected spy and you found a slip of paper on him with those numbers on it, exactly as they are above.

cipher

share|improve this question

asked Aug 1 at 23:16

Abd Elmaseh IshakAbd Elmaseh Ishak

1822 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Has a correct answer been given? If so, please don't forget to $colorgreencheckmark smalltextAccept$ it :)
  $endgroup$
  – Rubio♦
  Aug 5 at 7:44
  

  
  
  
  

add a comment | 

3

$begingroup$

116313333134261542156511321455121126113213151461123615112516114142

OK, so recently I made up a way of sending coded messages and I was just wondering how difficult it would be for someone to crack.
So let's say, for example, that you are in the army and you caught a suspected spy and you found a slip of paper on him with those numbers on it, exactly as they are above.

cipher

share|improve this question

asked Aug 1 at 23:16

Abd Elmaseh IshakAbd Elmaseh Ishak

1822 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Has a correct answer been given? If so, please don't forget to $colorgreencheckmark smalltextAccept$ it :)
  $endgroup$
  – Rubio♦
  Aug 5 at 7:44
  

  
  
  
  

add a comment | 

$begingroup$

116313333134261542156511321455121126113213151461123615112516114142

OK, so recently I made up a way of sending coded messages and I was just wondering how difficult it would be for someone to crack.
So let's say, for example, that you are in the army and you caught a suspected spy and you found a slip of paper on him with those numbers on it, exactly as they are above.

cipher

share|improve this question

asked Aug 1 at 23:16

Abd Elmaseh IshakAbd Elmaseh Ishak

1822 bronze badges

$endgroup$

share|improve this question

asked Aug 1 at 23:16

Abd Elmaseh IshakAbd Elmaseh Ishak

1822 bronze badges

share|improve this question

asked Aug 1 at 23:16

Abd Elmaseh IshakAbd Elmaseh Ishak

1822 bronze badges

asked Aug 1 at 23:16

Abd Elmaseh IshakAbd Elmaseh Ishak

1822 bronze badges

asked Aug 1 at 23:16

Abd Elmaseh IshakAbd Elmaseh Ishak

1822 bronze badges

1 Answer
1

active

oldest

votes

15

$begingroup$

The first thing that's apparent is that

the numbers are all in the range 1..6.

Since

the number of letters in the alphabet is comparable to 6 squared,

it's natural to consider

pairs of digits,

especially as

the total number of digits is even. It's also a multiple of 3, but it doesn't look as if there's much repetition in the digit-triples, so that isn't a very promising line of attack.

An obvious guess is that

letters are mapped into pairs of digits in some consistent way (there's already a pretty obvious guess, but let's be a little methodical here).

We then notice that

there are quite a lot of 11 and 15, which would work nicely if those were A (first letter) and E (fifth letter).

So the obvious guess is

that at least 11...16 are a..f.

Looking at what that gives us

and considering whether then 21..26 are g..l, etc.,

we notice

ba.a.ced which could be "balanced" if 26 is L

and now

we just do the obvious thing, interpreting a digit pair ab as letter 6(a-1)+b,

and get

a_complete_and_balanced_breakfast where each _ is a (different, as it happens) "out-of-range" digit pair.

Seems like we've cracked it.

(Is there an egg joke somewhere around here?)

In answer to the question of how difficult it is to crack,

I think it took somewhere between three and five minutes to go through the process above, though I confess my very first thought on looking at the string of digits was pretty much the actual answer.

share|improve this answer

answered Aug 1 at 23:37

Gareth McCaughan♦Gareth McCaughan

78.5k33 gold badges198198 silver badges304304 bronze badges

$endgroup$

add a comment | 

Your Answer

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "559"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);

Sign up using Google

Sign up using Facebook

Sign up using Email and Password

Post as a guest

Name

Email

Required, but never shown

StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f86792%2fsecret-message-01%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

15

$begingroup$

The first thing that's apparent is that

the numbers are all in the range 1..6.

Since

the number of letters in the alphabet is comparable to 6 squared,

it's natural to consider

pairs of digits,

especially as

the total number of digits is even. It's also a multiple of 3, but it doesn't look as if there's much repetition in the digit-triples, so that isn't a very promising line of attack.

An obvious guess is that

letters are mapped into pairs of digits in some consistent way (there's already a pretty obvious guess, but let's be a little methodical here).

We then notice that

there are quite a lot of 11 and 15, which would work nicely if those were A (first letter) and E (fifth letter).

So the obvious guess is

that at least 11...16 are a..f.

Looking at what that gives us

and considering whether then 21..26 are g..l, etc.,

we notice

ba.a.ced which could be "balanced" if 26 is L

and now

we just do the obvious thing, interpreting a digit pair ab as letter 6(a-1)+b,

and get

a_complete_and_balanced_breakfast where each _ is a (different, as it happens) "out-of-range" digit pair.

Seems like we've cracked it.

(Is there an egg joke somewhere around here?)

In answer to the question of how difficult it is to crack,

I think it took somewhere between three and five minutes to go through the process above, though I confess my very first thought on looking at the string of digits was pretty much the actual answer.

share|improve this answer

answered Aug 1 at 23:37

Gareth McCaughan♦Gareth McCaughan

78.5k33 gold badges198198 silver badges304304 bronze badges

$endgroup$

add a comment | 

15

$begingroup$

The first thing that's apparent is that

the numbers are all in the range 1..6.

Since

the number of letters in the alphabet is comparable to 6 squared,

it's natural to consider

pairs of digits,

especially as

the total number of digits is even. It's also a multiple of 3, but it doesn't look as if there's much repetition in the digit-triples, so that isn't a very promising line of attack.

An obvious guess is that

letters are mapped into pairs of digits in some consistent way (there's already a pretty obvious guess, but let's be a little methodical here).

We then notice that

there are quite a lot of 11 and 15, which would work nicely if those were A (first letter) and E (fifth letter).

So the obvious guess is

that at least 11...16 are a..f.

Looking at what that gives us

and considering whether then 21..26 are g..l, etc.,

we notice

ba.a.ced which could be "balanced" if 26 is L

and now

we just do the obvious thing, interpreting a digit pair ab as letter 6(a-1)+b,

and get

a_complete_and_balanced_breakfast where each _ is a (different, as it happens) "out-of-range" digit pair.

Seems like we've cracked it.

(Is there an egg joke somewhere around here?)

In answer to the question of how difficult it is to crack,

I think it took somewhere between three and five minutes to go through the process above, though I confess my very first thought on looking at the string of digits was pretty much the actual answer.

share|improve this answer

answered Aug 1 at 23:37

Gareth McCaughan♦Gareth McCaughan

78.5k33 gold badges198198 silver badges304304 bronze badges

$endgroup$

add a comment | 

$begingroup$

The first thing that's apparent is that

the numbers are all in the range 1..6.

Since

the number of letters in the alphabet is comparable to 6 squared,

it's natural to consider

pairs of digits,

especially as

the total number of digits is even. It's also a multiple of 3, but it doesn't look as if there's much repetition in the digit-triples, so that isn't a very promising line of attack.

An obvious guess is that

letters are mapped into pairs of digits in some consistent way (there's already a pretty obvious guess, but let's be a little methodical here).

We then notice that

there are quite a lot of 11 and 15, which would work nicely if those were A (first letter) and E (fifth letter).

So the obvious guess is

that at least 11...16 are a..f.

Looking at what that gives us

and considering whether then 21..26 are g..l, etc.,

we notice

ba.a.ced which could be "balanced" if 26 is L

and now

we just do the obvious thing, interpreting a digit pair ab as letter 6(a-1)+b,

and get

a_complete_and_balanced_breakfast where each _ is a (different, as it happens) "out-of-range" digit pair.

Seems like we've cracked it.

(Is there an egg joke somewhere around here?)

In answer to the question of how difficult it is to crack,

I think it took somewhere between three and five minutes to go through the process above, though I confess my very first thought on looking at the string of digits was pretty much the actual answer.

share|improve this answer

answered Aug 1 at 23:37

Gareth McCaughan♦Gareth McCaughan

78.5k33 gold badges198198 silver badges304304 bronze badges

$endgroup$

share|improve this answer

answered Aug 1 at 23:37

Gareth McCaughan♦Gareth McCaughan

78.5k33 gold badges198198 silver badges304304 bronze badges

answered Aug 1 at 23:37

Gareth McCaughan♦Gareth McCaughan

78.5k33 gold badges198198 silver badges304304 bronze badges

answered Aug 1 at 23:37

Gareth McCaughan♦Gareth McCaughan

78.5k33 gold badges198198 silver badges304304 bronze badges