User j.p.

74 votes

Accepted

How can I generate large prime numbers for RSA?

answered Jul 13, 2011 at 12:18

13 votes

Accepted

Why do all hash functions use big-endian data?

answered Mar 19, 2012 at 11:36

6 votes

How does asymmetric encryption work?

answered Aug 31, 2011 at 19:01

6 votes

How to efficiently generate a random safe prime of given length?

answered Dec 26, 2018 at 23:44

5 votes

Accepted

Efficient setup for a Montgomery multiplication

answered Nov 14, 2012 at 9:08

5 votes

Accepted

Why are side channel attacks such as SPA/DPA/ CPA based on the AES SubBytes routine?

answered Dec 30, 2016 at 1:17

5 votes

Is it possible to fool Miller-Rabin test?

answered Aug 1, 2023 at 6:56

4 votes

What does $(a+b) \bmod{256}$ and $a$ XOR $b$ reveal about $a, b$?

answered Apr 28, 2022 at 21:10

4 votes

About integer factorization

answered Apr 9, 2019 at 17:58

3 votes

Inversion in $GF(2^{10})$ Using Composite Fields

answered Mar 21, 2020 at 8:53

3 votes

Accepted

Finding a solution to a (sort of) discrete logarithm by asking questions

answered May 22, 2012 at 9:49

3 votes

Is an RSA variant with public exponent $e=f+(p-1)\cdot(q-1)$ safe (for $f$ random in some small interval)?

answered Oct 31, 2012 at 22:16

2 votes

How to perform Multiplicative Inverse Modulo in IDEA

answered Mar 15, 2013 at 9:08

2 votes

RSA Private Exponent Generation according to FIPS 186-4 in openssl v1

answered Sep 8, 2021 at 7:01

2 votes

Accepted

Any speed up methods for finding the index of a random value produced by the Inversive congruential generator?

answered Nov 25, 2019 at 15:16

2 votes

Accepted

Determine if $f(x)+x_0+x_n$ is balanced

answered Mar 1, 2019 at 19:31

2 votes

Efficient pen-and-paper calculation of the Galois Field multiplication?

answered Mar 17, 2019 at 10:16

2 votes

Checking if discrete logarithm is $\geq\frac{\varphi(p)}2$ in polynomial time?

answered Feb 23, 2018 at 10:49

2 votes

Accepted

Biased RSA moduli and ROCA

answered Feb 28, 2018 at 21:56

2 votes

Accepted

Fast evaluation of polynomials

answered Sep 26, 2018 at 17:41

1 vote

Are modified implementations of cryptographic algorithms a good idea?

answered Nov 11, 2014 at 11:17

0 votes

Are there public $p$ and $q$ numbers for use in DSA?

answered Jan 23, 2017 at 8:15

0 votes

Is there an encryption algorithm that only adds minimal (if any) size compared to the size of the unencrypted data?

answered Apr 4, 2018 at 6:54

Stack Exchange Network

23 Answers

How can I generate large prime numbers for RSA?

Why do all hash functions use big-endian data?

How does asymmetric encryption work?

How to efficiently generate a random safe prime of given length?

Efficient setup for a Montgomery multiplication

Why are side channel attacks such as SPA/DPA/ CPA based on the AES SubBytes routine?

Is it possible to fool Miller-Rabin test?

What does $(a+b) \bmod{256}$ and $a$ XOR $b$ reveal about $a, b$?

About integer factorization

Inversion in $GF(2^{10})$ Using Composite Fields

Finding a solution to a (sort of) discrete logarithm by asking questions

Is an RSA variant with public exponent $e=f+(p-1)\cdot(q-1)$ safe (for $f$ random in some small interval)?

How to perform Multiplicative Inverse Modulo in IDEA

RSA Private Exponent Generation according to FIPS 186-4 in openssl v1

Any speed up methods for finding the index of a random value produced by the Inversive congruential generator?

Determine if $f(x)+x_0+x_n$ is balanced

Efficient pen-and-paper calculation of the Galois Field multiplication?

Checking if discrete logarithm is $\geq\frac{\varphi(p)}2$ in polynomial time?

Biased RSA moduli and ROCA

Fast evaluation of polynomials

Are modified implementations of cryptographic algorithms a good idea?

Are there public $p$ and $q$ numbers for use in DSA?

Is there an encryption algorithm that only adds minimal (if any) size compared to the size of the unencrypted data?