Reputation
14,430
Next tag badge:
102/100 score
17/20 answers
Badges
1 36 76
Newest
 Nice Answer
Impact
~288k people reached

Sep
29
reviewed No Action Needed RSA with small exponents?
Sep
29
reviewed No Action Needed Does the elliptic curve (EC) cryptosystem outperform RSA and DL cryptosystems?
Sep
29
comment How can a Encrypt-And-MAC scheme be insecure if the encryption is CCA secure?
If the MAC is deterministic it will produce identical tags for identical messages, thus leaking if they're the same.
Sep
28
comment Safe curves in Weierstrass form?
Most of the advantages of safe curves only apply if you use Mongomery or (twisted) Edwards form for computation. Or do you just want to use Weierstrass form for easy prototyping with MIRACL and then switch to another form for production use?
Sep
27
comment Do we have to consider the cryptographic properties of the decryption, if we're only using the encryption?
Sounds like a very weird cipher. Most ciphers I know differ by only one round or so. I'd guess it has been designed with some unusual goals in mind, like very high parallelism in one direction and not as a general purpose block-cipher.
Sep
27
comment Is there specific name for simple XOR with ADD/SUB encoding?
Obfuscation might fit.
Sep
27
reviewed Approve Reuse of a DH / ECDH public key
Sep
27
comment Sextic twist maps to q Eigenspace of Frobenius
Since you found the answer yourself, you could post an answer referencing the paper and preferably giving a short summary of the proof idea.
Sep
27
comment Sextic twist maps to q Eigenspace of Frobenius
@cryptostase Why should we delete the question? I'm no expert in that area, but it looks like a valid question to me.
Sep
26
comment Shared modulus attack on RSA
@Mr.Vendetta But what's the point of giving them different keys? Since each of them knows the factors of n, each of them can decrypt messages to any $e$.
Sep
26
comment Shared modulus attack on RSA
Why are you using several exponents? What advantage over a single $e$ do you expect from that?
Sep
26
comment Shared modulus attack on RSA
Are those people using the same $e$? If no, why?
Sep
26
revised If I compute the SHA-1 of all possible 40 digits hexadecimal strings, will I get all possible sha1 hashes?
added 3 characters in body; edited title
Sep
26
reviewed Leave Closed research on Encryption for master
Sep
26
reviewed Reviewed converting finite field elements to octet strings
Sep
26
revised converting finite field elements to octet strings
added 18 characters in body
Sep
26
comment If I compute the SHA-1 of all possible 40 digits hexadecimal strings, will I get all possible sha1 hashes?
I've edited the duplicate question so it's applicable to more hashes.
Sep
26
revised Are common cryptographic hashes bijective when hashing a single block of the same size as the output?
added 56 characters in body; edited tags; edited title
Sep
26
reviewed Close If I compute the SHA-1 of all possible 40 digits hexadecimal strings, will I get all possible sha1 hashes?
Sep
25
reviewed Close What is the significance of the Period of a Steam Cipher