This website uses cookies. By clicking Accept, you consent to the use of cookies. Click Here to learn more about how we use cookies.

Turn on suggestions

Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Mute
- Printer Friendly Page

i made a cryptograph program in python 3

Options

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

05-24-2021 06:10 PM - edited 05-24-2021 06:11 PM

see the video here;

get the python 3 program here, its the file called "crypto";

GitHub - dothehokiepokie/mystuffyouknow: my stuff

here's the result:

input word:

word = "abcd"

results:

['a1', 'b2', 'c3', 'd4']

a no_letter_added

b right_letter_added

c left_letter_added

d left_letter_added_right_letter_added

['a2', 'b3', 'c4', 'd2']

a right_letter_added

b left_letter_added

c left_letter_added_right_letter_added

d right_letter_added

['a3', 'b4', 'c2', 'd3']

a left_letter_added

b left_letter_added_right_letter_added

c right_letter_added

d left_letter_added

['a4', 'b2', 'c3', 'd4']

a left_letter_added_right_letter_added

b right_letter_added

c left_letter_added

d left_letter_added_right_letter_added

[Done] exited with code=0 in 0.05 seconds

i mean to incorporate this into my sarcasm program to find made up words that share common letter characters in some logical way. but i may not. i did this after i read about the Morpheus cpu.

3 REPLIES 3

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

05-25-2021 03:54 PM - edited 05-25-2021 03:56 PM

i updated my crypto program, now it makes a sentence from a single word then you can feed that sentence into the sarcasm program to find the most sarcastic word and take that as the encryption key thats true;

here the youtube video:

and the first post has the github link to get the python 3 progam called crypto.

heres the new results

# original input word

the original input word = donkey

# each element is a single letter from the input string

# print the decryption each element number

# the first two numbers are the actual letter,

# the second and third numbers are the false letter

# the fifth number is the pattern to make from the added false letters added to the false letter

[['04121', '15272', '14253', '11344', '05262', '25103'], ['04312', '15123', '14174', '11202', '05323', '25214'], ['04343', '15234', '14252', '11193', '05204', '25132'], ['04254', '15202', '14163', '11174', '05302', '25213']]

# print the encryption made from the decryption key

[['c', 'rv', 'cp', 'aya', 'qm', 'wa'], ['vj', 'ac', 'php', 'kl', 'gw', 'wlw'], ['gy', 'wnw', 'pv', 'mj', 'gkg', 'df'], ['opo', 'kv', 'xg', 'aha', 'uc', 'fl']]

# the 4 strings made from the one input string which makes a sentence to feed into the sarcasm program

crvcpayaqmwa vjacphpklgwwlw gywnwpvmjgkgdf opokvxgahaucfl

[Done] exited with code=0 in 0.079 seconds

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

05-29-2021 11:52 AM - edited 05-29-2021 02:19 PM

a way to make this a artificial intelligence program:

if counter == 1: "no_letter_added"

= w on the keyboard wasd

elif counter == 2: "right_letter_added"

= a on the keyboard wasd

elif counter == 3: "left_letter_added"

= d on the keyboard wasd

elif counter == 4: "left_letter_added_right_letter_added"

= s on the keyboard wasd

as the ball moves its line of movement makes its point of convergence with the paddle

the ball moves in a line that line is made up of lines pixels that are moved through by various wasd key presses.

down wasd

left or right wasd

if the ball doesn't hit the wall:

ball on pixel row x = down one pixel, left or right n number of pixels

ball on pixel row x1 = down one pixel, left or right n number of pixels

ball on pixel rox x2 = down one pixel, left or right n number of pixels

else:

#the wall changes the direction of the ball so change the (left to right) or (right to left)

ball on pixel row x = down one pixel, left or right n number of pixels

ball on pixel row x1 = down one pixel, left or right n number of pixels

ball on pixel rox x2 = down one pixel, left or right n number of pixels

ball on pixel rows left or right wasd = (ball on pixel row x = left or right n number of pixels) + (ball on pixel row x1 = left or right n number of pixels) + (ball on pixel row x2 = left or right n number of pixels)

ball on pixel rows down wasd = (ball on pixel row x = down one pixel) + (ball on pixel row x1 = down one pixel) + (ball on pixel row x2 = down one pixel)

for y in range ((total down wasd pixels) // (ball on pixel rows down wasd)): # the ball eventually goes to the pixel line the paddle is on.

move the paddle (ball on pixel rows left or right wasd)

this ends the crypto program

what follows is the sarcasm program

sarcasm starts out with the input from crypto of where the ball will meet the paddle.

if the ball doesn't hit the wall:

ball on pixel row x = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)

ball on pixel row x1 = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)

ball on pixel rox x2 = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)

else:

#the wall changes the direction of the ball so change the (left to right) or (right to left)

ball on pixel row x = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)

ball on pixel row x1 = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)

ball on pixel rox x2 = up one pixel, angle_1 = (left or right n number of pixels), angle_2 = (left or right n number of pixels)

ball on pixel rows left or right wasd = (ball on pixel row x = left or right n number of pixels) + (ball on pixel row x1 = left or right n number of pixels) + (ball on pixel row x2 = left or right n number of pixels)

ball on pixel rows up wasd = (ball on pixel row x = up one pixel) + (ball on pixel row x1 = up one pixel) + (ball on pixel row x2 = up one pixel)

paddle(middle, left, right):

middle angle 1 = (ball on pixel rows left or right wasd)

middle angle 2 = (ball on pixel rows left or right wasd)

left angle 1 = (ball on pixel rows left or right wasd)

left angle 2 = (ball on pixel rows left or right wasd)

right angle 1 = (ball on pixel rows left or right wasd)

right angle 2 = (ball on pixel rows left or right wasd)

# the paddle meeting the ball can be in three different spots on the paddle;

# middle = deflection, depending on if the paddle is moving or still, two possible angles

# left = move ball left in variable angles, depending on if the paddle is moving or still, two possible angles

# right = move ball right in variable angles depending, on if the paddle is moving or still, two possible angles

# sarcasm then makes the bricks a input sentence to get to the most valuable brick.

for x in range bricks:

for y in range ((total up wasd pixels) // (ball on pixel rows up wasd)): # the ball eventually goes to the pixel line the brick is on.

x = x,[y = paddle(middle, left, right)] # the ball is moved by the paddle to the pixels the brick is on

each brick is a line of pixels from the paddle up to the brick.

moved through from the paddle up to the brick in reverse order from how the ball fell.

for each row the ball moves left or right some value and eventually meets the intended brick.

then sarcasm moves the paddle through each brick, each brick = a word in the input sentence.

to eventually get the ball to the most valuable brick.

which is when the ball goes to the top of the bricks and bounces down multiple times.

the sarcasm moves the ball to this brick because it is the highest value of sarcasm.

because it is the word with the most matches.

a match can be where the ball breaks a brick.

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

12-08-2021 02:42 AM