meta user
network profile
| bio | website | conradoplg.cryptoland.net |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 7 months |
| seen | 10 hours ago | |
| stats | profile views | 14 |
|
May 18 |
revised |
Polynomial multiplication and division in 2^128 fixed grammar |
|
May 17 |
answered | Polynomial multiplication and division in 2^128 |
|
Apr 21 |
awarded | Nice Answer |
|
Apr 12 |
revised |
What data is saved in RSA private key? fixed acronym |
|
Apr 12 |
awarded | Revival |
|
Apr 10 |
answered | What data is saved in RSA private key? |
|
Mar 28 |
answered | How do I unpack the x and y values from the BITSTRING in a DER ECDSA public key? |
|
Mar 6 |
comment |
How are Elliptic Curve Cryptography and Pairing Based Cryptography related? Yes, but the only alternative I know is PBC using elliptic nets, which are related but different to ECC. |
|
Mar 6 |
answered | How are Elliptic Curve Cryptography and Pairing Based Cryptography related? |
|
Feb 25 |
awarded | Editor |
|
Feb 25 |
revised |
Security of pairing-based cryptography over binary fields regarding new attacks added 804 characters in body |
|
Feb 24 |
awarded | Promoter |
|
Feb 22 |
asked | Security of pairing-based cryptography over binary fields regarding new attacks |
|
Feb 1 |
comment |
Decryption a chunk of file with AES That's completely up to you. In your example, you have 10 chunks; you can decrypt the first five in one thread and the last five in another. The only restriction is that the size of each chunk must be a multiple of the block size of the cipher, e.g. 16 bytes in the case of AES. |
|
Feb 1 |
comment |
Decryption a chunk of file with AES Sorry, I'm not sure what is you question. Read the initial counter value. Determine the number of blocks, divide by the number of (e.g.) cores, and decrypt each chunk of blocks in each core. |
|
Jan 31 |
answered | Decryption a chunk of file with AES |
|
Jan 25 |
comment |
Modulus for elliptic curve point multiplication I strongly suggest you to refer to a stardard reference like Hankerson et. al's "Guide to Elliptic Curve Cryptography" or Menezes et. al's "Handbook of Applied Cryptography". Anyway, if the result of the subtraction is negative, simply add $p$ to the result (since you're working modulo $p$, this will not "change" the value). |
|
Jan 22 |
awarded | Commentator |
|
Jan 22 |
comment |
Modulus for elliptic curve point multiplication You can use any irreducible polynomial. Usually it's $x^2 + 1$, which is irreducible if $-1$ does not have a square root modulo $p$. The same for other degrees: use a $n$-degree irreducible polynomial. Note that for efficiency a "tower of extensions" is often used (e.g. quartic extension can be built as an quadratic over another quadratic). Ask another question if you need details. I also suggest reading this: everything2.com/user/Swap/writeups/finite+field |
|
Jan 22 |
answered | Modulus for elliptic curve point multiplication |
