User fgrieu

3 votes

Accepted

RSA perfect square phi

answered 2 days ago

2 votes

Cannot get RSA encrypt and decrypt to work in hardware and online calculator

answered 2 days ago

4 votes

Accepted

In RFC 2313 (PKCS1/RSA) said you could recreate the Private key from 'n' and 'd', which later versions removed. Why?

answered Dec 5 at 10:44

0 votes

Accepted

Z-coordinate in Jacobian coordinates

answered 2 days ago

16 votes

Accepted

Algorithm to factorize $N$ given $N$, $e$, $d$

answered Sep 19, 2018 at 8:39

0 votes

Accepted

Probability when representing message as a point on elliptic curve

answered Dec 4 at 21:45

1 vote

Accepted

Possible to encrypt message without knowing recipient public key?

answered Dec 4 at 10:11

4 votes

What happens if we know that for an RSA key pair, the equation $d^e \equiv c \pmod{n}$ holds?

answered Dec 2 at 16:18

0 votes

Using the MAC to verify if Cipher Only attack has succeeded

answered Nov 30 at 7:51

2 votes

Are Safe and Sophie Germain primes evenly distributed?

answered Nov 28 at 20:16

1 vote

What's the name of the property of ideal cryptographic hash functions that effectively make it a random number generator?

answered Nov 27 at 16:46

7 votes

Accepted

Why do we need additional secret value (k) in ECDSA?

answered Nov 26 at 19:53

0 votes

How to prove that an algorithm is the time optimal algorithm for implementing a problem?

answered Nov 27 at 10:22

3 votes

Accepted

Signature using RSA (as described in Cryptography engineering)

answered Nov 3, 2017 at 12:17

7 votes

Are curve secp256k1 ECDSA signatures distinguishable from random data?

answered Nov 21 at 11:15

3 votes

Does combining a stream cipher and block cipher produce any vulnerabilities?

answered Nov 22 at 7:35

2 votes

Decryption of Naccache–Stern cryptosystem is not guaranteed for large keys

answered Nov 15 at 16:10

1 vote

Accepted

How to evaluate the minimum complexity of the key recovery when the success probability p is given？

answered Nov 15 at 10:37

3 votes

Accepted

In RSA, how to calculate the private exponent 'd', after choosing 'e'?

answered Jan 6 at 11:06

2 votes

Accepted

Key exchange for encrypted firmware update

answered Nov 13 at 9:15

1 vote

Is gcd(e,p−1)=1=gcd(e,q−1) similar to gcd(e,phi(n))=1?

answered Nov 12 at 12:33

5 votes

All 32 bit primes on 1 640Mb CD-ROM , and then used as immediate lookup of resulting prime factors, is that even possible, in early 1990s?

answered Nov 12 at 10:01

1 vote

Accepted

Can ECDSA be broken if same nonce is used with the same message?

answered Nov 10 at 13:34

4 votes

Accepted

Is this new bound for Wiener Attack well accepted?

answered Nov 9 at 11:32

7 votes

Can the encryption exponent e be greater than ϕ(N)?

answered Dec 17, 2012 at 14:56

6 votes

Accepted

Appropriate public exponent choice for RSA encryption

answered Dec 7, 2019 at 15:34

0 votes

Construction of Blake2 and Cha Cha

answered Nov 8 at 19:24

2 votes

Accepted

Why exclude the last group element when picking Elgamal secret key

answered Oct 31 at 12:54

4 votes

Modular multiplication of two k-bit numbers takes k^2 modular additions?

answered Oct 31 at 8:54

6 votes

Why does symmetric encryption not provide authentication and integrity? Is it only this type of encryption or cryptology in general have this issue?

answered Oct 28 at 22:30

Stack Exchange Network

2,347 Answers

RSA perfect square phi

Cannot get RSA encrypt and decrypt to work in hardware and online calculator

In RFC 2313 (PKCS1/RSA) said you could recreate the Private key from 'n' and 'd', which later versions removed. Why?

Z-coordinate in Jacobian coordinates

Algorithm to factorize $N$ given $N$, $e$, $d$

Probability when representing message as a point on elliptic curve

Possible to encrypt message without knowing recipient public key?

What happens if we know that for an RSA key pair, the equation $d^e \equiv c \pmod{n}$ holds?

Using the MAC to verify if Cipher Only attack has succeeded

Are Safe and Sophie Germain primes evenly distributed?

What's the name of the property of ideal cryptographic hash functions that effectively make it a random number generator?

Why do we need additional secret value (k) in ECDSA?

How to prove that an algorithm is the time optimal algorithm for implementing a problem?

Signature using RSA (as described in Cryptography engineering)

Are curve secp256k1 ECDSA signatures distinguishable from random data?

Does combining a stream cipher and block cipher produce any vulnerabilities?

Decryption of Naccache–Stern cryptosystem is not guaranteed for large keys

How to evaluate the minimum complexity of the key recovery when the success probability p is given？

In RSA, how to calculate the private exponent 'd', after choosing 'e'?

Key exchange for encrypted firmware update

Is gcd(e,p−1)=1=gcd(e,q−1) similar to gcd(e,phi(n))=1?

All 32 bit primes on 1 640Mb CD-ROM , and then used as immediate lookup of resulting prime factors, is that even possible, in early 1990s?

Can ECDSA be broken if same nonce is used with the same message?

Is this new bound for Wiener Attack well accepted?

Can the encryption exponent e be greater than ϕ(N)?

Appropriate public exponent choice for RSA encryption

Construction of Blake2 and Cha Cha

Why exclude the last group element when picking Elgamal secret key

Modular multiplication of two k-bit numbers takes k^2 modular additions?

Why does symmetric encryption not provide authentication and integrity? Is it only this type of encryption or cryptology in general have this issue?