Cryptography plan

"FriendCrypt" on Github

cool story bro

>being so dumb you have to use a flowchart rather than just memorizing everything

>being so dumb you have to use a computer to post on Sup Forums rather than just reading all the bits as they arrive

But it is understandable.

>IV, Key and Seed are the same thing
>Thinking that secure RNGs exist
>only 1 round
>using simple XOR
>the whole security relies on the RNG

Yes, short description: RNG use hash (sha-3)
If you know plain text and chipertext, maybe you can get message digest (but shuffle is used). Can you get key from digest?

Assuming this method is actually secure (and doesn't has any bias in the shuffle or the RNG) it will be slower than AES-256. Nice job, nitwit. You created a worse alternative to an existing encryption.

Yes! But ECC was a bad idea in the past. And now? You have 384 or 512 bit AES? You see quantum future?

"If the key is truly random, never reused, and kept secret, the one-time pad is theoretically unbreakable."

OTP XOR's, the only encryption that never can be broken by qunatum computers, its just noice output, any solution

The original plan: ~RNG(iv, key) -> Hash(iv) + Hash(key)
You can reuse the key.

Not OP, but, AES, RSA all depend on the RNG
>>the whole security relies on the RNG

Well all RNG can be reused, called non-One-time-pads

"Google use tape. It is slow. But why use this?"

Don't misuse some random RNG (no pun intended) as a stream cipher. Also, the shuffling at the end add nothing makes evaluating the security more difficult. What are you trying to accomplish?

NEVER roll your own crypto, unless you study said crypto

I would like speak with Math prof, but never find one. This plan born in my brain in 1 years ago... And now i send this to the Internet and wait for 3rd opinion or 3rd help.

Learn English or kill yourself, you fucking shit stain.

Step 1 - buy Applied Cryptography by Bruce Schneier
Step 2 - read Applied Cryptography by Bruce Schneier
Step 3 - understand very little of Applied Cryptography by Bruce Schneier
Step 4 - Go back to step 2.

see until you become as good as Arjen Lenstra, go back to css

Good plan! But you can use low size block mixer.

>Good plan! But you can use low size block mixer.

This like Vigenère cipher, but hash key never repeated and you can not get message digest, because random suffle is used.

This project new name is "FriendCipher", C++ source available on GitHub