9,467 reputation
12346
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years
seen 32 mins ago

Sep
2
comment Key Refresh in Diffie-Hellman
How would you get your partners public key with respect to the new generator?
Sep
2
comment Key Refresh in Diffie-Hellman
Why do you want to change the key? In your question it sounds like you change keys for changes sake.
Sep
2
revised Where can I double check my elliptic curve results?
added 3 characters in body
Sep
2
comment Initialization vector in symmetric-key encryption
What is the underlying issue behind "there is no way to create an initialization vector for each encryption"? Do you need length preserving encryption? Or deterministic encryption? Or is there no CSPRNG?
Sep
1
revised Storing Credentials for a Third Party
added 258 characters in body
Aug
31
comment Is there a cryptographic function or system in which it becomes HARDER to break as time passes?
Doesn't seem useful in practice. It's easy to design huge security margins against brute-force into a system. Crypto doesn't get broken by brute-force nowadays. It's either broken by analysis (finding a flaw in the crypto) or circumvented (finding flaws in the software). The only potential brute-force attack that's not easy to prevent is a quantum computer, but we'll solve that in a few years as well.
Aug
31
reviewed Approve suggested edit on Feedback requested on a method of posting a message without revealing the author
Aug
16
reviewed Approve suggested edit on Voting scheme where the votes become public when a threshold is reached
Aug
16
comment Types of Cryptography for a 4-8 bit microcontroller
Why do you mention diffie-hellman? Your code doesn't have anything in common with DH. DH takes at least million cycles. If you can afford DH, you can afford a sane symmetric algo. There is also the whole field of lightweight crypto that attempts to construct cheap but secure crypto. Unlike your system which seems about as secure as caesar encryption.
Aug
16
comment Any practical uses of machine learning for cryptography?
The closest thing to automated cryptoanalysis are SAT solvers.
Aug
16
comment One Time Pad Question
Take the ciphertext you have and the message you want, xor them. That gives you the key which decrypts the message to that given message. Obviously this only works with OTPs, not with short key stream-ciphers.
Aug
16
reviewed Approve suggested edit on Could this be a valid variation of the Schnorr protocol?
Aug
15
comment Is there any research about cryptography on nondeterministic Turing machines?
BTW quantum computers can only solve problems in BQP efficiently, which is much smaller than MA (the probabilistic equivalent of NP). (At least as far as we know, obviously we can't prove that ATM since we don't even know for sure if P!=NP)
Aug
15
comment Is there any research about cryptography on nondeterministic Turing machines?
I'm not an expert on complexity theory, but I'd expect a straight forward proof that an attack against an encryption scheme on a non deterministic turing machine can't take longer than the legitimate operation on a normal machine.
Aug
14
comment Vulnerabilities if encrypting the same data with 2 different keys
As long as the encryption used with k1 and k2 is secure Eve won't be able to learn kaes1. But there are two risks here: 1) Charlie will be able to decrypt messages sent before he joined the group 2) If Eve ever learns kaes1 she can decrypt all messages. I prefer shorter lived keys to limit the window of exposure.
Aug
14
revised Is there an algorithm or hardware that can sign/verify natural time?
added 51 characters in body
Aug
14
comment Can padding length, and thus plaintext length, be considered public information when using aes-cbc?
What's really important is that you compute a MAC over the whole ciphertext (not plaintext), including padding and IV. Attempting to authenticate the plaintext is a bad idea with CBC mode, you really need to authenticate the ciphertext with a proper MAC.
Aug
12
comment RC2, RC4, RC5 key length
In principle RC4 could consume an arbitrarily long key, as long as it consists of complete bytes, but you don't gain anything once the key-size exceeds the state-size.
Aug
11
comment Verify Messages to Embedded Device
I'd use a deterministic variant of ECDSA. Perhaps Ed25519, perhaps Thomas Pornin's proposal and perhaps a simple hash of private key and message hash.
Aug
10
revised What is the fastest elliptic curve operation f(P) in affine coordinates such that f^n(P)=P only if n is large?
added 850 characters in body