Not many can claim 25 years on the Internet! Join us in celebrating this milestone. Learn more about our history, and thank you for being a part of our community!
quote: Original post by Maximus
Quantum computers already exist. A demonstration of their power was one being used to crack 512bit encryption, which it did... in approximately 0.12 seconds IIRC
quote: Original post by Sinner_Zero
please..........just someone say yes and I''ll be happy, hell even if you don''t know what the hell I''m talking about. Just say yes and I''ll go on with my life here, please.
quote: Original post by Sinner_Zero
Well I''m more confused than a drunken munkey.
now, this ''^'' thinger, I understand it sorta, see now, it compares bits, if theyre equal it returns 1 and if theyre no it returns 0.
For each bit in A and B the following truth table gives the result: A | B | A xor B ---+---+--------- 0 0 0 0 1 1 1 0 1 1 1 0e.g. A = 1001101 B = 0011011A xor B = 1010110quote:
how can I get access to the binary''s? I mean I assume I can make my own little thinger that like puts the binary code into like a string and manipulate it from there but is there anything that already does this for you? maybe I should start looking into assembly?
quote:
Ok, I was just looking into some assembly and saw that (quite simple) they had the regular binary <--> decimal switching code. So assuming C++ can''t regularly do this I can make (this is a sensible way of encryption?) my own int to binary then back to int encryption/decryption no?
quote: Original post by Sinner_Zero
well I saw a doc before that said to change the numbers to binary then put all the binaries into one line and divide them into like 4''s instead of 8''s and change them back to ints or chars or whatever.
I mean how can I do that without making like a binary string? or base2 as you say which I can only see possible by storing into strings.
