Search:

Type: Posts; User: lordshinmei; Keyword(s):

Search: Search took 0.02 seconds.

  1. Replies
    2
    Views
    6,436

    Like Darkes said, there are many other algorithms...

    Like Darkes said, there are many other algorithms one could use for which this process would be ineffective. Symmetric ciphers like AES and Blowfish are immune to this type of cryptanalysis: for...
  2. Replies
    5
    Views
    6,966

    Im not sure how you could get a word file to...

    Im not sure how you could get a word file to work...
    You could always just save as ASCII with line break, even if you're in Word. However, there is probably a way to do it for regular Word files....
  3. Thread: Encription

    by lordshinmei
    Replies
    11
    Views
    11,433

    The NSA can definitely crack 128/256-bit PGP; I...

    The NSA can definitely crack 128/256-bit PGP; I don't know about AES since it's pretty new. I would upgrade to RSA with 1024 or 2048-bit keys and keep the AES also. For extra security, if you don't...
  4. Replies
    0
    Views
    5,471

    chaos theory in cryptography

    Okay, I've been reading a lot about complexity theory (aka chaos theory) lately, and I think some of the mathematical models could be useful in cryptography. For example, the Lorenz Attractor can be...
  5. Thread: Encription

    by lordshinmei
    Replies
    11
    Views
    11,433

    The only way to break AES128 is to use a bunch of...

    The only way to break AES128 is to use a bunch of supercomputers, unless an internal weakness is found in the algorithm. Combined with PGP it should be pretty secure. How large are the keys for that...
  6. Replies
    15
    Views
    13,928

    Jose Padilla's civil rights

    Okay, probably most of you have heard about Jose Padilla and his alleged plans to carry out a "dirty bomb" attack on the US. If you haven't, check pretty much any newspaper for details. Anyway, the...
  7. Morfius: 128 bit Rijndael and 1024 bit RSA could...

    Morfius: 128 bit Rijndael and 1024 bit RSA could only be broken by really powerful computers, a.k.a. an entire network of supercomputers like the NSA has. But they probably wouldn't bother...
  8. It could be screwed up in the way that The Old...

    It could be screwed up in the way that The Old Man said, but if you're using it for chatting, why not just send the key manually via the IRC client? In other words, just 'say' it in the chat room....
  9. djf: Of course you could use a dictionary...

    djf: Of course you could use a dictionary attack against a stupid user. However, you don't have to use a normal password. The algorithm supports full ASCII and passwords could be a large number or...
  10. LoggOff: I use a TI-89. It's really great- it'll...

    LoggOff: I use a TI-89. It's really great- it'll solve multivariable equations, graph in 3D, and handle really big numbers right down to the units digit usually. I recommend it strongly. Also, I...
  11. 95^20 is nothing if you've got supercomputers and...

    95^20 is nothing if you've got supercomputers and all that good stuff...but (2^32)^64 is! If you had a billion billion computers and each could check a billion billion keys per second, then it would...
  12. sorry, my last message go cut off-- I was going...

    sorry, my last message go cut off-- I was going to say that AES is only a more complicated setup of the same Fiestel networks used in DES, but everyone knows it is more secure.
  13. First of all, in cryptography the point of a...

    First of all, in cryptography the point of a random number generator is NOT to give irreproducible results. THe whole point of the random number generator in this algorithm is to produce keystreams....
  14. Replies
    3
    Views
    8,826

    Someone already solved one and they KNOW that...

    Someone already solved one and they KNOW that it's a book cipher. But you're right, he almost definitely did not use book ciphers for all the others.
  15. >All you need is the password. so what is the...

    >All you need is the password. so what is the purpose of the hash???? Also, if your random number generator only has one seed, then it isn't even close to being random. >Even a simple one like the...
  16. LogOff: I meant that I would patent the random...

    LogOff: I meant that I would patent the random number generators and algorithms specific to this encryption method, not subtraction in general :)
    Also, I just want to clarify how key distribution...
  17. You know, SHA-256 is useful for other things...

    You know, SHA-256 is useful for other things other than just digital signatures and other identity verification. One could use it to create a 256-bit key for AES or something by entering a "password"...
  18. OK, first I'll reply to the thing about the...

    OK, first I'll reply to the thing about the random number generator. Darkes said earlier that relying on a random number generator is not a good idea because you can check every seed rather than...
  19. What you said is true. But about the part where...

    What you said is true. But about the part where you said that the ciphertext gives us a good idea of the size of the plaintext and key... this is not always true.

    119124302439284
    - ...
  20. Replies
    18
    Views
    18,870

    you could just get a decompiler and decompile...

    you could just get a decompiler and decompile Snood... then you could just look through the source code until you find the algorithm...
  21. Replies
    17
    Views
    15,861

    If it's uncrackable, then it can't be ROT13...

    If it's uncrackable, then it can't be ROT13...
  22. subtraction

    Okay, here's something interesting...
    It only works with subtraction!
    Say you add them together. There is NOT an infinite number of positive numbers whose sum is a given number. If you allow...
  23. response

    Rewandythal said earlier that if you take the wrong key and get the wrong answer that seems to make sense but not in context with the message's subject, then you will know that it is wrong. However,...
  24. unbreakable encryption by means of simple subtraction

    A normal onetime pad uses modular arithmetic to perform rotations on plaintext. An "e" might rotate to a "b" if the key number is greater than 21. This operation is memory-intensive and...
  25. Replies
    24
    Views
    28,329

    onetime pad with PRNG

    It was said earlier that the onetime pad is completely secure but that a large key must be created and stored. If the key is found then the security is compromised. Well, what if the actual key were...
Results 1 to 25 of 25