Fuck, I have the intelligence of a Zimbabwe nigger when it comes to encryption.
Jackson Reed
>encryption without a key You meant encoding.
Nolan Lee
Post a hash of the plaintext using a well known algorithm in order to prove that you did not change the algorithm as soon as someone found the plaintext.
Samuel Miller
It isn't really cryptanalysis unless you post the algorithm or a much larger ciphertext. If posting the algorithm weakens the "security", then it's worthless to begin with.
Connor Foster
>or a much larger ciphertext Or parts of the plaintext as well.
>If posting the algorithm weakens the "security", then it's worthless to begin with. This
Post algorithm. Just a cyphertext is worthless. It could literally mean anything.
Ian Howard
>posting algorithm makes I guess I misunderstood the game. I thought the fun was figuring it out based on the encoded info alone.
Wyatt Morgan
decode this ;^)
Elijah Diaz
this you fucking idiot also why would anybody bother
Nolan Wright
That is provably impossible.
Brayden Hughes
if it's based on a current encryption then sure. if it's something you and only you know then no one will be able to figure it out.
Zachary Wood
I mean, I may have thought it up, but it only uses already practiced encoding methods.
Bentley Reyes
Decode this: > 1 23 4 567890
I bet you can't figure it out. The algorithm is really easy however.
Carter Bailey
Fine, here's a hint that should make it infinitely possible.
%256
Luke Lee
If its a code than I'm sure you could crack it would just be an enormous waste of time. If it's actually some sort of encryption than it's impossible without the key.
Brandon Nguyen
I misunderstood the meaning of encryption. It's encoded
Hunter Jackson
lol
Elijah Hughes
See You are lying, you are just butthurt that someone found your plaintext.
Logan Reyes
See 1234567890 Decrypt this
Isaiah Barnes
Hilarious
Kevin Ross
See
Jackson Adams
Why are you refusing to post a hash of the plaintext? Could it be because you are trolling?
Luis Smith
So it is an infinite number of possible combinations, wew. Good "encryption system".
Levi Wood
Gonna be a newfag for a sec, is there a site I can quickly do this at?
David Howard
technically all answers are correct, we can get the OP's hash from infinite number of "passwords" using infinite number of algorithms
Angel Jenkins
>Doesn't even know how to hash something >makes an algorithm Oh god
Austin Howard
*encryption algorithm
Just run sha1sum or whatever
Gabriel Garcia
Look, alright. I've been taught professionally only with perl from the 90's and security is in no way my job.
Julian Cooper
We actually only need one trivial algorithm.
c=p
Nolan Kelly
Like this? >$2y$10$mCva26NBmiGjcsIzuUBzlu0oa6OZKh9wjN76WhrCmgC0CdUNByuLm hashed with BLOWFISH
Oliver Nguyen
good enough
Connor Torres
Blowfish is a block cipher. This seems more like bcrypt. Just use sha1sum as I said before.
Ryan Gray
sorry, forgot to say that this is the first one I posted >68712 95333 20604 104140 102575 41600 78103 25167 86034 83452 37908
Aaron Bell
I decoded it! IM A HUGE FAGGOT PLEASE RAPE MY FACE
Gabriel Allen
that's beside the point
Cooper Adams
>five digit groups I see you've been reading about straddling checkerboards and old fashioned spy shit. I guess it's some kind of straddling checkerboard with an extra layer of something, because I can't find a conversion table that decodes this.
Dominic James
x.,Gy?4/8MpB@IASzEOW#OHLBBDt=-;I~42Mz1KKRwD=
Eli Fisher
Holy shit, I didn't know about that actually. I knew that the methods I chose couldn't be 100% original, but didn't know it actually was a thing. Thanks for letting me know.
Grayson Smith
I'm a huge faggot Please rape my face
What do I win
Grayson Young
Hint: Enter your password: abcdefghijklmnopqrstuvwxyz
Enter the base shift value: 32
Colton Kelly
#include
unsigned char get (void) { char penis[6] = {0}; for (int i = 0; i < 5; i++) { int c; do { c = getchar (); if (c == -1) return -1; } while (!isdigit (c)); penis[i] = c; } return atoi (penis) % 255; }
int main (void) { unsigned char res[100] = {0}; int len = 0; for (; !feof (stdin); len++) res[len] = get (); for (int i = 0; i < (unsigned char)-1; i++) { for (int j = 0; j < len; j++) putchar (isalnum (res[j] - i) ? res[j] - i : '#'); putchar ('\n'); } return 0; }