meta user
network profile
| bio | website | |
|---|---|---|
| location | Saarbrücken, Germany | |
| age | 25 | |
| visits | member for | 1 year, 7 months |
| seen | 9 hours ago | |
| stats | profile views | 24 |
|
14h |
reviewed | No Action Needed What are the potential security impacts of using CRAM-MD5 for Emails, when not using an SSL connection? |
|
14h |
reviewed | Reviewed Selective format-compliant JPEG encryption? |
|
16h |
comment |
When truncating an AES MAC value by “w” , how do I justify that “w” is still negligible? That's a misuse of the term negligible. Negligibility is defined for functions. (Roughly the function is dominated by the inverse of any polynomial for large enough input values.) No constant non-zero function (such as $2^{-63}$) can ever be negligible. |
|
19h |
reviewed | No Action Needed Polynomial multiplication and division in 2^128 |
|
1d |
comment |
Generate fixed length cipher text from arbitrary length plaintext Yes you are of course correct. So in conclusion, while the functionality as stated is theoretically impossible, it can be emulated in most practical circumstances, if the benefit outweighs the potentially large overhead. |
|
1d |
reviewed | No Action Needed Help me describe/identify this challenge-response protocol/algorithm? |
|
1d |
reviewed | No Action Needed Generating IV in TLS 1.2 |
|
1d |
reviewed | No Action Needed Encrypting a broadcast channel |
|
1d |
reviewed | No Action Needed CSPRNG in JavaScript using Audio and Video |
|
1d |
reviewed | No Action Needed Is this a sensible cryptographic protocol intending to reduce the impact of compromised security? |
|
1d |
reviewed | No Action Needed Hill-cipher, disordered alphabet |
|
1d |
reviewed | No Action Needed Using an MD5 hash as a password |
|
1d |
reviewed | No Action Needed PKCS#11: Which CKK_types are supported by CKM_PKCS5_PBKD2? |
|
1d |
comment |
Generate fixed length cipher text from arbitrary length plaintext I'm just not sure that this answers the question. Of course you can always assume some upper bound (space on harddrive, duration of your "random" stream) and pad your plaintexts to this length. (This is essentially what you are doing) but the question explicitly stated that an upper bound was not wanted. |
|
1d |
reviewed | Close calculating beta for elgamal elliptic curves |
|
1d |
reviewed | Close pseudo random sequence and permutation functions |
|
1d |
comment |
Generate fixed length cipher text from arbitrary length plaintext What exactly is the end you do achieve that way? |
|
1d |
answered | Generate fixed length cipher text from arbitrary length plaintext |
|
2d |
comment |
Encrypting a broadcast channel @PaŭloEbermann From an efficiency standpoint, it would probably be a disaster to use an actual broadcast-encryption scheme to stream large amounts of data. I was more thinking of a broadcast-encryption scheme as a solution to the problem you highlighted in your last paragraph. |
|
May 14 |
comment |
Encrypting a broadcast channel Well what you would be looking for is a (aptly named) broadcast encryption scheme. I think the notion was first introduced by Fiat and Naor at CRYPTO 93 (Broadcast Encryption") but I do not know what the current state of the art is. |
