[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 120 KB, 1200x960, cryptography.jpg [View same] [iqdb] [saucenao] [google]
9406893 No.9406893 [Reply] [Original]

Set structure:
Create set(s) A,B,C.
Populate set(s) A,B,C with alternating English alphabet: e.g: A[B],B[B],C[C]...
A[A,D,G,J,M,P,S,V,Y]
B[B,E,H,K,N,Q,T,W,Z]
C[C,F,I,L,O,R,U,X]
Combine these set(s):
A∪B[A,B,D,E,G,H,J,K,M,N,P,Q,S,T,V,W,Y,Z]
B∪C[B,C,E,F,H,I,K,L,N,O,Q,R,T,U,W,X,Z]
C∪A[A,C,D,F,G,I,J,L,M,N,O,P,R,S,U,V,X,Y]
A∪B∪C[A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z]
Usage:
To encode:
Start at set A∪B, then B∪C, then C∪A, then back to A∪B.
If needed value is missing from set(s), index in A∪B∪C, then return to A∪B.
Convert alphameric set signifiers to numeric via ordinary English alphabet placement.
Remove symbolic set signifiers.
Convert A∪B, B∪C, C∪A and A∪B∪C to numeric from their placement in their respective unified set(s).
To decode:
Reverse operation.
Example:
Plaintext:
MATHEMATICS
Encoded:
129123112142351235129123112142363121213

>> No.9406900
File: 509 KB, 1920x1080, Screenshot_2018-01-01-03-07-46.png [View same] [iqdb] [saucenao] [google]
9406900

>> No.9406931

>>9406900
>Not using an adblocker

>> No.9406952
File: 232 KB, 300x300, 1307889832001.png [View same] [iqdb] [saucenao] [google]
9406952

>>9406931
>blocking ass

>> No.9406962
File: 9 KB, 221x250, 1509457552273.jpg [View same] [iqdb] [saucenao] [google]
9406962

>>9406952
>blocking malware

>> No.9406993

>>9406893
well, thats a fun puzzle idea.
but it would be easy to crack.
look into AES and RSA

>> No.9407008
File: 37 KB, 800x450, facading_brainlet.jpg [View same] [iqdb] [saucenao] [google]
9407008

>>9406962
>blocking security strength test

>> No.9407012

>>9406993
I use AES for serious things.
I just thought I'd share the novel method I came up with during a critical thinking lecture (*read: waste of time).

>> No.9407429

Anyone else?

>> No.9407479

in crypto an encryption scheme is only considered secure if the method of encryption is known but it is still hard to break without the key.

I also suspect this reduces to a basic substitution cipher which means it could be broken quickly with letter frequency attacks.

>> No.9408131

cryptography is HARD

>> No.9408350

>>9408131
it's so hard you can't even prove that it's hard

>> No.9408931

>>9407479
It was just meant to be a quick and simple concept that you can employ unaided.

>> No.9408935

>>9407479
Also:
>Populate set(s) A,B,C with alternating English >alphabet: e.g: A[B],B[B],C[C]...
>A[A,D,G,J,M,P,S,V,Y]
>B[B,E,H,K,N,Q,T,W,Z]
>C[C,F,I,L,O,R,U,X]
Is the substitution cipher portion of it.
Which is then followed by obfuscation of that with a sort of substitution cipher built on-top of a substitution cipher:
>Combine these set(s):
>A∪B[A,B,D,E,G,H,J,K,M,N,P,Q,S,T,V,W,Y,Z]
>B∪C[B,C,E,F,H,I,K,L,N,O,Q,R,T,U,W,X,Z]
>C∪A[A,C,D,F,G,I,J,L,M,N,O,P,R,S,U,V,X,Y]
>A∪B∪C[A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z]
And then on-top of that you have the stream of A,B,Cs and Ds, but it both for decryption and encryption purposes.
And with that, even if you knew the cipher and knew to look for the stream of set(s) data, if the original encryptor had populated the set(s) differently, the solved the unified set(s) in a different order, that would throw you too.
I don't think it would be simple to decrypt without the use of a computer to brute force it.

>> No.9409182

Interesting idea but it is easy to crack having only the final code there is 129 for a m and so on you have for every letter 3 different numbers. You can aswell say m-129 a-123 and so on

>> No.9409186

>>9408935
Yes, but simple ciphers are trivial just by examining frequencies.

>> No.9410103

>>9409186
Would you mind brute forcing the cipher for me and seeing how long it takes?