0% found this document useful (0 votes)
117 views7 pages

Bacon Bilateral Cipher

This document describes the Bacon bilateral cipher. It begins with the famous quote "To be or not to be" followed by its binary encoding. It then shows the binary representations of letters A-Z. The document encodes the phrase "BACON" using the cipher and choosing the text "To be or not to be" as camouflage text to hide the encoded message within.

Uploaded by

Hunter6677
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
117 views7 pages

Bacon Bilateral Cipher

This document describes the Bacon bilateral cipher. It begins with the famous quote "To be or not to be" followed by its binary encoding. It then shows the binary representations of letters A-Z. The document encodes the phrase "BACON" using the cipher and choosing the text "To be or not to be" as camouflage text to hide the encoded message within.

Uploaded by

Hunter6677
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

BACON BILATERAL CIPHER

TO BE OR NOT TO BE. THAT IS THE


QUESTION...

TO BE OR NOT TO BE. THAT IS THE


QUESTION...

00 01 00 000 10 00. 1101 11 101 11010111...

000100000100011011110111010111
00010
00001
00011
01111
01110
10111

00010
00001
00011
01111
01110
10111

16
0
0
0
0
0
1

8
0
0
0
0
1
0

4
0
0
0
1
1
1

2
1
0
1
1
1
1

1
0
1
1
1
0
1

00010
00001
00011
01111
01110
10111

16
0
0
0
0
0
1

8
0
0
0
0
1
0

4
0
0
0
1
1
1

2
1
0
1
1
1
1

1
0
1
1
1
0
1

2
1
2+1 = 3
8+4+2+1=15
8+4+2 = 14
16+4+2+1=23

00010
00001
00011
01111
01110
10111

16
0
0
0
0
0
1

8
0
0
0
0
1
0

4
0
0
0
1
1
1

2
1
0
1
1
1
1

1
0
1
1
1
0
1

2
1
2+1 = 3
8+4+2+1=15
8+4+2 = 14
16+4+2+1=23

B
A
C
O
N
W

How to Encipher
Binary Representation of Positions in Alphabet
(Using 5 bit strings)
A
B
C
D
E
F
G
H
I
J
K
L
M

00001
00010
00011
00100
00101
00110
00111
01000
01001
01010
01011
01100
01101

N
O
P
Q
R
S
T
U
V
W
X
Y
Z

01110
01111
10000
10001
10010
10011
10100
10101
10110
10111
11000
11001
11010

Start with text to hide:


B
2
0
0
0
1
0

A
1
0
0
0
0
1

C
3
0
0
0
1
1

O
15
0
1
1
1
1

N
14
0
1
1
1
0

W
23
1
0
1
1
1

R
18
1
0
0
1
0

O
15
0
1
1
1
1

T
20
1
0
1
0
0

E
5
0
0
1
0
1

T
20
1
0
1
0
0

H
8
0
1
0
0
0

I
9
0
1
0
0
1

S
19
1
0
0
1
1

0001000001000110111101110101111001001111101000010110100010000100110011

Now pick text in which to do the hiding:

To be, or not to be--that is the question:


Whether 'tis nobler in the mind to suffer
The slings and arrows of outrageous fortune
Or to take arms against a sea of troubles
And by opposing end them.
Tobeornottobethatisthequestion
Whethertisnoblerinthemindtosuffer
Theslingsandarrowsofoutrageousfortune
Ortotakearmsagainstaseaoftroubles
Andbyopposingendthem

0001000001000110111101110101111001001111101000010110100010000100110011
TobeornottobethatisthequestionWhethertisnoblerinthemindtosufferTheslin

You might also like