Reputation
Next tag badge:
399/400 score
85/80 answers
Badges
1 32 77
Newest
 Enlightened
Impact
~525k people reached

6h
comment Reducing the degree of polynomial descripting a block cipher
What precisely do you mean? We generally don't try to express a block cipher as a genormous polynomial; what are you asking?
6h
reviewed Close Reducing the degree of polynomial descripting a block cipher
6h
reviewed No Action Needed How to decrypt a PGP message with only the two primes and the public exponent?
6h
reviewed No Action Needed Operation modes of block ciphers how are used?
13h
reviewed Close Sharing a secret key between many users
13h
reviewed Reviewed VKO GOST R 34.10-2001 (described in RFC4357), Key Agreement Algorithm. Looking for its implementation/detailed description/examples
13h
comment VKO GOST R 34.10-2001 (described in RFC4357), Key Agreement Algorithm. Looking for its implementation/detailed description/examples
How is this an answer to the question?
13h
reviewed No Action Needed Why hash the message before signing it with RSA?
13h
reviewed No Action Needed Is it possible to make time-locked encrytion algorithm?
14h
comment One-time-pad with multiplication
"Does this introduce any security problems"; that's really hard to answer until to define the threat model;that is, what do you want to prevent someone from doing.
1d
reviewed Close What is the difference between H(M) and H3(M, s, IDA)?
1d
reviewed No Action Needed Bilinear pairing arithmetic - cryptographic accumulators
1d
reviewed No Action Needed Are covert and rational adversaries same?
1d
reviewed No Action Needed Elliptic Curve Cryptography Encryption and text representation implementation
1d
reviewed No Action Needed PGP public RSA key format
1d
comment One time pad in CBC mode?
@Stefan: against a correctly implemented OTP, KPA's and CPA's are impossible.
1d
answered One time pad in CBC mode?
1d
comment Is HMAC-MD5 still secure for commitment or other common uses?
In addition, most MACs (e.g. CMAC, Carter-Wegman MACs) make it easy to create collisions (and even second preimages) if you know the key. HMAC (based on a collsion-resistant hash) is one of the few that doesn't make it easy. Kaminsky just showed that HMAC-MD5 doesn't have a property that most MACs also don't have.
1d
comment Is authentication length always a subset of encryption length?
@MaartenBodewes: minor note: while the obvious method of implementing GCM has you processing the AAD before the encrypted data, it's not that hard to process them in a different order.
1d
comment How to calculate RSA CRT parameters from public key and private exponent
@CodesInChaos: nope, it's just a temporary variable name.