Can You Decrypt This Encrypted Text Using a Numerical Technique?

  • Thread starter Baroudeh
  • Start date
  • Tags
    Text
In summary, the conversation discusses a numerical encryption technique used on an English text. The only available hint is "eight(8)" and it is believed that the numbers represent syllables. However, the speaker suggests that the hint may be more complicated and asks for any further theories or help in deciphering the text.
  • #36
As hints go, "eight(8)" is pretty worthless. Looks like a function call to me, but a function call can mask enormous complexity. As revealed in my last post, there is some sort of prefixing going on where values on many even indices form groups that differ by only the prefix

43 45 48 46
63 65 68 66
...
73 75 78 76

etc. Remove every digit on even indices and you get the table in my last post. As that reveals, the patterns just seem too repetitive to be meaningful text. Perhaps there is some kind of sorting going on.
 
Physics news on Phys.org
  • #37
My guess as to the pattern I have outlined here (I've bracketed all the common prefix numbers per line:


[43 45 48 46] [63 65 68 66] [72] [63] [58 57]

[73 75 78 76] [63 64 68 66] [53 54 58 56 52] [74] [89] [77 72] [63] [79] [57]

[12 13] [87 86] [22 23] [77 76] [32 33] [67 66] [42 43] [57 56]

[43 45 48 46] [53 55] [39] [47] [55 56] [68 66] [43 45 48 46] [53 55] [39] [47] [55 56] [68 66 63 64] [59] [68 64 65 68 67]

[43 45 48 46] [53 55 58 57] [63 65] [39] [47] [73 74] [68 66] [72] [63] [49] [67]

[12 13] [87 86] [22 23] [77 76] [32 33] [67 66] [42 43] [57 56]

[33 35 38 36] [43 45 48 47] [53 55 58 56] [63 64] [59 57] [72] [63] [39] [58] [63] [72] [58] [37]

[43 45 48 46] [53 54 58 57] [63 65 68 66]

[33 35 38 36] [53 55 58 56] [62] [53] [48 47 42] [33] [59 57 52] [42] [39] [58] [42] [52 58] [37]

[53 55 58 57 52 54]

[12 13] [87 86] [22 23] [77 76] [32 33] [67 66] [42 43] [57 56]

[63 65 68 66] [53 55 58 56] [73 74 78 77 72] [54 59 57] [62] [72] [69 68] [72] [62] [49] [58]

[63 65 68 67] [53 55] [48 46 43 45] [58 57] [72] [63] [39] [47]

[73 74 78 77] [63 64 68 66] [53 54 58 57] [74 75] [49] [67 64 65] [79] [68] [54] [5]

[33 35 38 37 35 36] [48 46] [53 55 58 57 55 56] [46 45] [63 65] [78 77 73 75] [49] [38] [75 76]

[33 35] [78 76] [53 55 58 56] [63 65] [38 37] [43 45] [37 36] [73 75]

My guesses as to how the words are made:

1) The possibility of a base-8 cypher is pretty good.
2) A combination of a base-8 cypher and a letter-number cypher is possible as well. What I mean by this is that the coder may have taken the code and used a base-8 cypher to code the text, then coded it again by attaching numbers to each letter (a-1, b-2, c-3, etc.) and then used a shift to code the text again.

Then, the [5] at the end of line 14 is still slightly peculiar, but could possibly be an "E" if the student was lazy and didn't use a shift, but just used the a-1, b-2 scale.

3) Finally, my last guess, which is highly unlikely as it would be quite easy to figure out, is the possibility that the student used a letter-number cypher, attaching 1-a, 2-b, etc. and then multiplied by a random amount to get a separate number, then divided that number by another random number, although not so random as to get a decimal, so that the numbers came out to be 2-digit numbers which need to be multiplied then counted to find the letter.

Those are my current guesses.
 
  • #38
seems that no one ever have decrypted this text
 
  • #39
al-mahed said:
seems that no one ever have decrypted this text

The interesting part, however, is how hard it is to crack once the algorithm is known.

What immediately springs to mind here is that if you separate every octet and then divide this into 4 two digit numbers, you get a pretty sequential set, also, the octets themselves form something which appears to be sequential.

At the digit level:

4345484663656866
=
[43454846] [63656866]
=
43 45 48 46 , 63 65 68 66
=
+2, +3, -4 , +2 +3, -4

At the octet level:
[4] [6] [7] [6] [5]

+2 +1 -1 -1

This suggests a positional increment as a way of turning a mono-alphabetic cipher into a poly-alphabetical one.

My guess (after looking at this for 5 minutes and not knowing the background of the student) would be that this algorithm works something similar to this:

Let a be 1
Take the first block of plain text, Pa (Assume a block is 4 chars long)
Take each char in the block, Cn and pass it through the cipher along with the increments:
Cipher(Cn, n, a);
Increment a until you are out of text.

In other words, "a" and "n" are double running increments, which account for the two intervals of symmetry (the one at the double digit level and the one at the octet level).

So the complete mask of the cipher would be the function f(a,n). If you strip that away you are left with a mono-alphabetic cipher.

This might be wrong of course, but as I said earlier, the real test of a cipher is how hard it is to break once the algorithm is known.

k
 
  • #40
<h2>1. What is a numerical technique for decrypting encrypted text?</h2><p>A numerical technique for decrypting encrypted text is a method that uses mathematical operations and algorithms to convert the encrypted text back into its original form.</p><h2>2. How does a numerical technique work for decrypting encrypted text?</h2><p>A numerical technique works by analyzing the patterns and structure of the encrypted text and using mathematical operations to reverse the encryption process and reveal the original message.</p><h2>3. Is a numerical technique the most effective way to decrypt encrypted text?</h2><p>It depends on the type of encryption used. In some cases, a numerical technique may be the most effective way to decrypt encrypted text, while in other cases, other techniques such as brute force or frequency analysis may be more effective.</p><h2>4. Can any type of encrypted text be decrypted using a numerical technique?</h2><p>No, not all types of encrypted text can be decrypted using a numerical technique. Some encryption methods are specifically designed to be resistant to numerical techniques and require more complex decryption methods.</p><h2>5. Are there any limitations or drawbacks to using a numerical technique for decrypting encrypted text?</h2><p>One limitation of using a numerical technique for decrypting encrypted text is that it may require a lot of computational power and time, especially for longer and more complex messages. Additionally, if the encryption method used is strong enough, a numerical technique may not be able to decrypt the text at all.</p>

1. What is a numerical technique for decrypting encrypted text?

A numerical technique for decrypting encrypted text is a method that uses mathematical operations and algorithms to convert the encrypted text back into its original form.

2. How does a numerical technique work for decrypting encrypted text?

A numerical technique works by analyzing the patterns and structure of the encrypted text and using mathematical operations to reverse the encryption process and reveal the original message.

3. Is a numerical technique the most effective way to decrypt encrypted text?

It depends on the type of encryption used. In some cases, a numerical technique may be the most effective way to decrypt encrypted text, while in other cases, other techniques such as brute force or frequency analysis may be more effective.

4. Can any type of encrypted text be decrypted using a numerical technique?

No, not all types of encrypted text can be decrypted using a numerical technique. Some encryption methods are specifically designed to be resistant to numerical techniques and require more complex decryption methods.

5. Are there any limitations or drawbacks to using a numerical technique for decrypting encrypted text?

One limitation of using a numerical technique for decrypting encrypted text is that it may require a lot of computational power and time, especially for longer and more complex messages. Additionally, if the encryption method used is strong enough, a numerical technique may not be able to decrypt the text at all.

Similar threads

  • Computing and Technology
2
Replies
52
Views
3K
  • Programming and Computer Science
Replies
5
Views
1K
  • Programming and Computer Science
Replies
7
Views
2K
  • Engineering and Comp Sci Homework Help
Replies
5
Views
2K
Replies
4
Views
3K
  • Programming and Computer Science
Replies
2
Views
2K
  • Sticky
  • Math Proof Training and Practice
Replies
0
Views
1K
Replies
2
Views
792
Replies
16
Views
2K
  • Sci-Fi Writing and World Building
Replies
9
Views
1K
Back
Top