Question

Why is Euler's totient function equal to $(p-1)(q-1)$ when $N=pq$ and $p$ and $q$ are prime in a clean intuitive way?

score 7.2k · Answer 1 · 2026-03-30 07:11:40

7.2k

Views

Why is Euler's totient function equal to $(p-1)(q-1)$ when $N=pq$ and $p$ and $q$ are prime in a clean intuitive way?

Published on 30 Mar 2026 - 7:11

score 84 · Answer 2 · 2014-01-08 08:30:56

84

Views

Strong primes in cryptography, their relation to complexity theory and security

Published on 08 Jan 2014 - 8:30

score 726 · Answer 3 · 2014-01-09 12:16:48

726

Views

How to make RSA function injective

Published on 09 Jan 2014 - 12:16

score 148 · Answer 4 · 2014-01-10 17:38:21

148

Views

Explanation of $d^{-1}$ in modular arithmetic

Published on 10 Jan 2014 - 17:38

score 152 · Answer 5 · 2026-03-29 07:40:28

152

Views

Manipulating square roots mod p (prime) and when is $g^{ \frac{x}{2}} = p - z_1 \pmod p$ true?

Published on 29 Mar 2026 - 7:40

score 478 · Answer 6 · 2014-01-13 00:31:35

478

Views

Manually performing the Miller-Rabin probabilistic primality test

Published on 13 Jan 2014 - 0:31

score 499 · Answer 7 · 2014-01-13 00:44:38

499

Views

ElGamal Public Key Cryptosystem and Digital Signature Scheme

Published on 13 Jan 2014 - 0:44

score 170 · Answer 8 · 2026-04-01 14:25:38

170

Views

Determine the number of divisors in $K[x]$ of $1 + x^{15}$ and of $1+x^{120}$

Published on 01 Apr 2026 - 14:25

score 427 · Answer 9 · 2014-01-13 13:06:13

427

Views

Determine a generator of $\mathbb{Z}^*_{11}$ manually.

Published on 13 Jan 2014 - 13:06

score 426 · Answer 10 · 2014-01-14 02:17:53

426

Views

Using knapsack problem for digital signatures

Published on 14 Jan 2014 - 2:17

score 1.4k · Answer 11 · 2026-03-28 10:35:22

1.4k

Views

Bachelor Thesis - Galois Theory Research Topics?

Published on 28 Mar 2026 - 10:35

score 112 · Answer 12 · 2014-01-15 20:27:37

112

Views

enumerating in pseudo random order

Published on 15 Jan 2014 - 20:27

score 58 · Answer 13 · 2014-01-18 15:45:12

58

Views

enumerating in pseudo random order - version 2

Published on 18 Jan 2014 - 15:45

score 1.2k · Answer 14 · 2014-01-19 06:40:36

1.2k

Views

How to show a function is negligible?

Published on 19 Jan 2014 - 6:40

score 909 · Answer 15 · 2014-01-20 22:40:16

909

Views

How do I row reduce a matrix mod 26 when it is singular mod 26?

Published on 20 Jan 2014 - 22:40

List Question

Why is Euler's totient function equal to $(p-1)(q-1)$ when $N=pq$ and $p$ and $q$ are prime in a clean intuitive way?

Strong primes in cryptography, their relation to complexity theory and security

How to make RSA function injective

Explanation of $d^{-1}$ in modular arithmetic

Manipulating square roots mod p (prime) and when is $g^{ \frac{x}{2}} = p - z_1 \pmod p$ true?

Manually performing the Miller-Rabin probabilistic primality test

ElGamal Public Key Cryptosystem and Digital Signature Scheme

Determine the number of divisors in $K[x]$ of $1 + x^{15}$ and of $1+x^{120}$

Determine a generator of $\mathbb{Z}^*_{11}$ manually.

Using knapsack problem for digital signatures

Bachelor Thesis - Galois Theory Research Topics?

enumerating in pseudo random order

enumerating in pseudo random order - version 2

How to show a function is negligible?

How do I row reduce a matrix mod 26 when it is singular mod 26?

Trending Questions

Popular # Hahtags

Popular Questions