32,921 reputation
565127
bio website bolet.org/~pornin
location Quebec City, Canada
age 39
visits member for 3 years, 4 months
seen yesterday

Cryptographer, programmer in several languages (C, Java, several assemblies, Pascal, Forth...). I also have a life.


Apr
2
reviewed Approve suggested edit on
Mar
30
answered How is the curve equation used in ECC?
Mar
28
answered Alert protocol in TLS
Mar
27
comment Difference between lightweight, online and low memory Authenticated Encryption schemes
One may also note that there are "semi-online" schemes where the size of the input (but not the contents) must be known from start (e.g. CCM).
Mar
27
awarded  Nice Answer
Mar
25
awarded  Good Answer
Mar
25
awarded  Nice Answer
Mar
25
answered Construct an encryption algorithm using hash function
Mar
23
reviewed Satisfactory Secure degree reduction for Shamir's secret sharing
Mar
23
reviewed Needs Improvement Choice of reduction polynomial in Whirlpool's internal cipher
Mar
23
reviewed Excellent ASCII: weakness
Mar
23
reviewed Excellent Is this approach to generating a “random” number from a sha512 hash effective?
Mar
23
reviewed Satisfactory Can passwords be stored securely so that a similarity comparison can be made?
Mar
23
reviewed Excellent Signature based on public key cryptography and forgery
Mar
23
reviewed Excellent simple multiplication in GF(8)
Mar
23
reviewed Needs Improvement One-time digital signatures
Mar
23
reviewed Excellent If PGP and GPG both follow the OpenPGP standard, are they 100% compatible in all use cases?
Mar
23
reviewed Excellent Certificate signature with SHA-1 and RSA: where do 1888 bits come from?
Mar
22
answered Is PKCS #1 v1.5 RSA encryption padding secure under these conditions?
Mar
19
comment Efficiency of computing $e(P,Q)$ Vs $g^a \pmod{p}$?
No, it is not always defined over a supersingular elliptic curve. It is defined overs "curves of low embedding degree". Supersingular curves have a low embedding degree, but are not alone in that category. However, parts of the computation must occur with elements from a field which is large enough to resist discrete logarithm (DLP, not ECDLP), and that's quite larger than what is used in normal elliptic curves (say, 1200 bits instead of 200), and that means higher computational cost.