"FriendCrypt" on Github
cool story bro
>>54565642
>being so dumb you have to use a flowchart rather than just memorizing everything
>>54565822
>being so dumb you have to use a computer to post on 4chan rather than just reading all the bits as they arrive
But it is understandable.
>>54565642
>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
>>54566115
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?
>>54566358
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.
>>54566693
Yes! But ECC was a bad idea in the past. And now? You have 384 or 512 bit AES? You see quantum future?
>>54566115
"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
>>54567508
The original plan: ~RNG(iv, key) -> Hash(iv) + Hash(key)
You can reuse the key.
>>54566115
Not OP, but, AES, RSA all depend on the RNG
>>the whole security relies on the RNG
>>54567604
Well all RNG can be reused, called non-One-time-pads
>>54566693
"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?
>>54565642
NEVER roll your own crypto, unless you study said crypto
>>54569348
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.
>>54569708
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.
>>54569708
see >>54569764
until you become as good as Arjen Lenstra, go back to css
>>54566693
Good plan! But you can use low size block mixer.
>>54569111
>Good plan! But you can use low size block mixer.
>>54565642
This like Vigenère cipher, but hash key never repeated and you can not get message digest, because random suffle is used.
>>54565642
This project new name is "FriendCipher", C++ source available on GitHub
