Beta Cipher Encryption

[53696c6661726]

3 Encryptions

Rule; Encryption must be set by the chronological order of 26 prime numbers paired up with the Alphabet as shown in fig 1.1

Fig 1.1
A - 2
B - 3
C - 5
D - 7
E - 11
F - 13
G - 17
H - 19
I - 23
J - 29
K - 31
L - 37
M - 41
N - 43
O - 47
P - 53
Q - 59
R - 61
S - 67
T - 71
U - 73
V - 79
W - 83
X - 89
Y - 97
Z - 101

This is the first layer of Encryption

As that is completed, you go on to make a next set of Prime Numbers, Which I call PrimesA

PrimesA are the prime numbers used to multiply certain Letters of the alphabet. These Primes are 2,3,5, and 7. An example of 2nd level encryption is shown.

Ex;
2 x D (7)= 14.
or
5 x D (7) = 35.

You can only chose one PrimeA if you want it to be easier for the person you're sending the message to.

3rd Level Encryption

As you multiply your Letter by a PrimeA, you then multiply by a Key


(Key; A number used to further encrypt the message by multiplying it by the number. Without the Key, Decryption is much more difficult to decrypt)

Ex; 35 x 3301 (key) = 115535.

This is the final result of the encrypted message.

Decryption

Decryption is rather easy.

If the person you are sending the message to knows the Key or knows the Key is hidden in the message, all they will have to do is Divide the final result by the Key

Ex; 115535 / 3301 = 35

and soon have to divide the Remaning Result by one of the PrimeA's, in which they have to Guess, or as with the Key, know that its hidden in the cipher

Ex; 35 / 5 = 7

atlast, they have the remaining prime (in this case 7).

As this is the last layer of encryption, it is also the easiest to crack if they see a pattern. All that is left to do is put that prim into chronological order with the Alphabet and you get the letter.

Note; This cipher is Highly Inefficient with large messages, and is rather used for short messages, such as mailing or a note

 

[shadowslice e]

Correct me if I'm wrong but I. fairly sure that you can only have 1 way the primes can come out if you completely factorise any number. For example, 5*3*7=105 and those are also the only prime numbers which can be created from 105.

And , if that's right, then all you would need to crack a cypher is to get a computer to completely factorise all the numbers then get a good anagram cracker and you're in (also, it would not be that hard to guess primes=letters because many internet protocols and security measures use prime numbers- but the reason that's fairly secure is because the prime numbers are huge and very, very difficult to crack).

So, in conclusion it would be better to use a series of numbers which are not prime and just have a list of them to share between you and your friend although for the purposes of just having a bit of fun, this could be a fairly effective code cause most people wouldn't want to do all the work.

Would there be a pattern to the way in which you use primesA? because if there is it would not make the cipher much harder (same goes for the 3rd level cipher if it is a prime number) because all you would have to do is to write out a list of the numbers and their factors to work out that there was a repeating set of numbers every so often (in this case 2, 3, 5, 7 and that every number had 3301- also a prime so can still be worked out by prime factorisation- as a factor). From there it is relatively easy to decrypt as I described in the post on your previous thread (mod please merge these threads).

So, in conclusion it would be much better to just use a series of composite numbers and multiply them as there would then be multiple composite numbers making up each number and share the list with your friend.