User Robert NACIRI

7 votes

Accepted

Is it safe to AES-CBC and AES-CMAC both using the same key?

answered Dec 18, 2014 at 0:24

6 votes

What prime lengths are used for RSA?

answered Feb 16, 2015 at 22:49

5 votes

Accepted

Solving Quadratic equations in Galois Field (2^163)

answered Dec 29, 2014 at 23:30

5 votes

Accepted

Are factorization algorithms parallelizable?

answered Mar 21, 2015 at 9:42

4 votes

Find private exponent in RSA

answered Dec 21, 2014 at 19:19

3 votes

Factors of RSA modulus

answered Jan 13, 2015 at 18:03

3 votes

Finding strong primes

answered Jan 23, 2015 at 20:45

3 votes

Diffie-Hellman key exchange using addition instead of multiplication?

answered Oct 30, 2016 at 13:12

2 votes

In the Quadratic Sieve, why restrict the factor base?

answered May 27, 2016 at 11:01

2 votes

Applications of GF(p) polynomials

answered Jan 28, 2015 at 17:38

2 votes

Accepted

Montgomery Algorithm

answered Jan 15, 2015 at 9:20

2 votes

Accepted

Secure way to encrypt and decrypt a folder on Mac or Linux?

answered Jan 22, 2015 at 9:24

2 votes

How does RSA padding work exactly?

answered Jan 22, 2015 at 20:21

1 vote

Smart Card - Entropy during on-board public key generation

answered Jan 2, 2015 at 14:24

1 vote

Accepted

Montgomery and Galois fields

answered Jan 20, 2015 at 10:40

1 vote

Accepted

Modular Reduction of polynomials in GF(2^m)

answered Dec 24, 2014 at 17:52

1 vote

how to let other people respond to emails only decrypt-able with my private key

answered Dec 25, 2014 at 23:12

1 vote

Power analysis and exponentiation by squaring

answered Dec 28, 2014 at 15:39

1 vote

Usage of GF(p^m) fields, where p != 2

answered Jan 29, 2015 at 18:02

1 vote

Generation of a cyclic group of prime order

answered Feb 1, 2015 at 18:33

1 vote

RSA generation of private key using public key

answered Feb 3, 2015 at 14:15

1 vote

Simple multiplication as an encryption method

answered Feb 8, 2015 at 10:25

1 vote

Factoring two RSA modulus with known $|p_1 - p_2| < \ell $

answered Feb 14, 2015 at 9:20

1 vote

How does knowing the factorization of N help to obtain the secret?

answered Mar 1, 2015 at 15:42

1 vote

Accepted

AES as Integer Program

answered Mar 3, 2015 at 20:22

1 vote

Accepted

RSA weak padding

answered Mar 25, 2015 at 10:50

1 vote

EC: Why does $h>200$ need to hold?

answered Jun 16, 2015 at 22:14

0 votes

Why should $a,b < N$ for Montgomery Reduction?

answered Jul 22, 2015 at 8:45

0 votes

How to make the range of modulo $p$ to $[-\frac{p}{2};\frac{p}{2}]$?

answered Apr 5, 2016 at 9:18

0 votes

Fault encryption attack on RSA

answered Mar 10, 2015 at 19:55

Stack Exchange Network

45 Answers

Is it safe to AES-CBC and AES-CMAC both using the same key?

What prime lengths are used for RSA?

Solving Quadratic equations in Galois Field (2^163)

Are factorization algorithms parallelizable?

Find private exponent in RSA

Factors of RSA modulus

Finding strong primes

Diffie-Hellman key exchange using addition instead of multiplication?

In the Quadratic Sieve, why restrict the factor base?

Applications of GF(p) polynomials

Montgomery Algorithm

Secure way to encrypt and decrypt a folder on Mac or Linux?

How does RSA padding work exactly?

Smart Card - Entropy during on-board public key generation

Montgomery and Galois fields

Modular Reduction of polynomials in GF(2^m)

how to let other people respond to emails only decrypt-able with my private key

Power analysis and exponentiation by squaring

Usage of GF(p^m) fields, where p != 2

Generation of a cyclic group of prime order

RSA generation of private key using public key

Simple multiplication as an encryption method

Factoring two RSA modulus with known $|p_1 - p_2| < \ell $

How does knowing the factorization of N help to obtain the secret?

AES as Integer Program

RSA weak padding

EC: Why does $h>200$ need to hold?

Why should $a,b < N$ for Montgomery Reduction?

How to make the range of modulo $p$ to $[-\frac{p}{2};\frac{p}{2}]$?

Fault encryption attack on RSA