meta user
network profile
| bio | website | |
|---|---|---|
| location | Saarbrücken, Germany | |
| age | 25 | |
| visits | member for | 1 year, 7 months |
| seen | 1 hour ago | |
| stats | profile views | 24 |
|
Apr 26 |
comment |
Algorithm digipass-like You would have to specify some kind of security you want to achieve. As the question currently stands, the solution is trivial. Use the identity function as E and check that the values are the same in D. |
|
Apr 18 |
comment |
How can I become familiar with the logic syntax used in Cryptography papers? Could you maybe give an example of the things you do not understand? |
|
Apr 9 |
comment |
AES+CTR+HMAC Encryption and Authentication on an Arduino Always authenticate the IV. A hash (such as SHA-256) offers no authentication whatsoever. Never use the same key for more than one purpose (unless you really know what you are doing). Theses are basic principles you should live by. I do not understand your last question. |
|
Apr 5 |
answered | Why constrain the message lengths in indistinguishability in the presence of an eavesdropper? |
|
Mar 13 |
comment |
Is there an efficient way to hide the encrypted plaintext length with a block cipher? Simply append arbitrary blocks to your plaintext and discard them after decryption? |
|
Mar 12 |
comment |
How to obtain a one-value share in Shamir's secret sharing If shares are bound to some ID, you could consider using a hash function to map that ID to an x-value. It is fine for the x-values to be predictable, so there's no problem there, and the hash's collision resistance should guarantee that you choose distinct x-values. The holder of the share can then simply recompute x. |
|
Feb 25 |
revised |
Chosen Plaintext Attacks edited tags |
|
Feb 21 |
comment |
Security system theoretical task However depending on the circumstances it might not be instantiable. An upper bound on the plaintext size could be considered useful. |
|
Feb 18 |
reviewed | No Action Needed Is sharing the modulus for multiple RSA key pairs secure? |
|
Feb 18 |
reviewed | Reviewed RSA SHA1 signature from public key |
|
Feb 18 |
reviewed | No Action Needed AES encryption with shared IV |
|
Feb 18 |
reviewed | No Action Needed What are unified addition and differential addition in elliptic curve point arithmetic? |
|
Feb 18 |
reviewed | Reviewed Implementations of Ntru TLS |
|
Feb 18 |
reviewed | No Action Needed How can I validate generated session keys in SRP-6a protocol |
|
Feb 18 |
reviewed | Close Why is RSA encryption significantly faster than decryption? |
|
Feb 10 |
reviewed | No Action Needed Attack XOR encryption of binary data compressed by zlib with known key length (very short key) |
|
Feb 10 |
reviewed | No Action Needed Can the hash of one message be used to make it easier to find the hash of a very similar message? |
|
Feb 10 |
reviewed | No Action Needed ElGamal signature: Forging a signature of a specific form |
|
Feb 10 |
reviewed | No Action Needed Why is Diffie-Hellman considered in the context of public key cryptography? |
|
Feb 10 |
reviewed | No Action Needed Obtaining a key that's using ice algorithm |
