Question

Understanding why the public exponent $e$ is chosen the way it is in RSA

score 1k · Answer 1 · 2015-01-28 10:20:47

1k

Views

Understanding why the public exponent $e$ is chosen the way it is in RSA

Published on 28 Jan 2015 - 10:20

score 12.2k · Answer 2 · 2015-01-29 18:37:16

12.2k

Views

Modular Arithmetic - pairs of additive inverse pairs and multiplicative inverse pairs

Published on 29 Jan 2015 - 18:37

score 5k · Answer 3 · 2026-03-28 20:57:50

5k

Views

Finding the Modular Multiplicative Inverse of a large number

Published on 28 Mar 2026 - 20:57

score 154 · Answer 4 · 2015-01-30 15:26:34

154

Views

Does this approach for factorizing RSA numbers help in any way?

Published on 30 Jan 2015 - 15:26

score 91 · Answer 5 · 2015-01-30 19:02:32

91

Views

Finding all the solutions of a linear equations

Published on 30 Jan 2015 - 19:02

score 5.4k · Answer 6 · 2015-01-30 22:59:26

5.4k

Views

Given an encryption key in a transposition cipher, find the decryption key

Published on 30 Jan 2015 - 22:59

score 2.3k · Answer 7 · 2026-02-23 10:18:43

2.3k

Views

$a$ has a square root modulo $p$ if and only if its discrete logarithm log$_{g}(a)$ modulo $p - 1$ is even

Published on 23 Feb 2026 - 10:18

score 1.7k · Answer 8 · 2015-02-03 02:28:21

1.7k

Views

Proving that a set Rn (relatively prime with respect to any n) is a group

Published on 03 Feb 2015 - 2:28

score 30 · Answer 9 · 2015-02-03 21:57:40

30

Views

Cryptographic encoding scheme that enables counting

Published on 03 Feb 2015 - 21:57

score 37 · Answer 10 · 2015-02-06 21:09:39

37

Views

Future-Proof Encrypt for Multiple Independent Parties

Published on 06 Feb 2015 - 21:09

score 415 · Answer 11 · 2015-02-08 19:36:12

415

Views

Suppose that you had a machine that could find all four solutions for some given $a$. How could you use this machine to factor $n$?

Published on 08 Feb 2015 - 19:36

score 2.3k · Answer 12 · 2015-02-10 06:44:51

2.3k

Views

How to prove this modular multiplication property to be true?

Published on 10 Feb 2015 - 6:44

score 139 · Answer 13 · 2015-02-11 14:39:45

139

Views

Function for encryption/decryption - What is $n \phi(n)$?

Published on 11 Feb 2015 - 14:39

score 6.3k · Answer 14 · 2015-02-12 03:34:35

6.3k

Views

Finding the Order of a group and the Order of each element

Published on 12 Feb 2015 - 3:34

score 1.1k · Answer 15 · 2015-02-12 07:57:03

1.1k

Views

Generating elements of a Galois Field using an irreducible polynomial

Published on 12 Feb 2015 - 7:57

List Question

Understanding why the public exponent $e$ is chosen the way it is in RSA

Modular Arithmetic - pairs of additive inverse pairs and multiplicative inverse pairs

Finding the Modular Multiplicative Inverse of a large number

Does this approach for factorizing RSA numbers help in any way?

Finding all the solutions of a linear equations

Given an encryption key in a transposition cipher, find the decryption key

$a$ has a square root modulo $p$ if and only if its discrete logarithm log$_{g}(a)$ modulo $p - 1$ is even

Proving that a set Rn (relatively prime with respect to any n) is a group

Cryptographic encoding scheme that enables counting

Future-Proof Encrypt for Multiple Independent Parties

Suppose that you had a machine that could find all four solutions for some given $a$. How could you use this machine to factor $n$?

How to prove this modular multiplication property to be true?

Function for encryption/decryption - What is $n \phi(n)$?

Finding the Order of a group and the Order of each element

Generating elements of a Galois Field using an irreducible polynomial

Trending Questions

Popular # Hahtags

Popular Questions