Question

Why is the RSA exponentiation function a permutation (i.e. a bijection) over $\mathbb{Z}^*_N$

score 163 · Answer 1 · 2014-01-21 20:17:50

163

Views

Why is the RSA exponentiation function a permutation (i.e. a bijection) over $\mathbb{Z}^*_N$

Published on 21 Jan 2014 - 20:17

score 329 · Answer 2 · 2014-01-21 22:49:24

329

Views

Using Euler Totient to compute digits in $3^{40000005}$

Published on 21 Jan 2014 - 22:49

score 216 · Answer 3 · 2026-03-28 10:54:20

216

Views

Closest vector problem

Published on 28 Mar 2026 - 10:54

score 80 · Answer 4 · 2014-01-29 11:47:27

80

Views

Help me come up with a function

Published on 29 Jan 2014 - 11:47

score 3.9k · Answer 5 · 2014-01-29 16:43:49

3.9k

Views

Plaintext attacks: affine cipher

Published on 29 Jan 2014 - 16:43

score 995 · Answer 6 · 2014-02-02 23:38:21

995

Views

Prove: b passes the Fermat test for $m = p^2$ if and only if $b^{p-1}\equiv 1\pmod {p^2}$

Published on 02 Feb 2014 - 23:38

score 485 · Answer 7 · 2014-02-03 19:46:26

485

Views

Can hash function be considered as linear functional?

Published on 03 Feb 2014 - 19:46

score 533 · Answer 8 · 2014-02-05 05:45:55

533

Views

Why does a key have to be at least as long as a message (cryptography)?

Published on 05 Feb 2014 - 5:45

score 75 · Answer 9 · 2014-02-06 03:30:48

75

Views

Modular arithmetic to find the mod of a large number

Published on 06 Feb 2014 - 3:30

score 284 · Answer 10 · 2014-02-07 10:41:02

284

Views

decoding an encrypted text with modulo

Published on 07 Feb 2014 - 10:41

score 11.2k · Answer 11 · 2014-02-12 06:15:32

11.2k

Views

Cube roots modulo $p$

Published on 12 Feb 2014 - 6:15

score 611 · Answer 12 · 2026-03-30 10:37:20

611

Views

Inverse Totient Function, given $n$ find all possible is for $\phi(i)=n$

Published on 30 Mar 2026 - 10:37

score 188 · Answer 13 · 2014-02-16 02:06:07

188

Views

E: $y^2+y=x^3$ an elliptic curve over $F_{2}$. How to prove the number of $E(F_{2^n})$ = $2^n+1$ if n is odd, ....

Published on 16 Feb 2014 - 2:06

score 509 · Answer 14 · 2014-02-17 01:02:06

509

Views

Is it possible to do elliptic curve cryptography over $\mathbb{Q}$ instead of a finite field?

Published on 17 Feb 2014 - 1:02

score 1k · Answer 15 · 2014-02-25 10:28:57

1k

Views

Understanding Wikipedia claim: modular multiplicative inverse of $17\pmod{\phi(3233)}$ is $2753$

Published on 25 Feb 2014 - 10:28

List Question

Why is the RSA exponentiation function a permutation (i.e. a bijection) over $\mathbb{Z}^*_N$

Using Euler Totient to compute digits in $3^{40000005}$

Closest vector problem

Help me come up with a function

Plaintext attacks: affine cipher

Prove: b passes the Fermat test for $m = p^2$ if and only if $b^{p-1}\equiv 1\pmod {p^2}$

Can hash function be considered as linear functional?

Why does a key have to be at least as long as a message (cryptography)?

Modular arithmetic to find the mod of a large number

decoding an encrypted text with modulo

Cube roots modulo $p$

Inverse Totient Function, given $n$ find all possible is for $\phi(i)=n$

E: $y^2+y=x^3$ an elliptic curve over $F_{2}$. How to prove the number of $E(F_{2^n})$ = $2^n+1$ if n is odd, ....

Is it possible to do elliptic curve cryptography over $\mathbb{Q}$ instead of a finite field?

Understanding Wikipedia claim: modular multiplicative inverse of $17\pmod{\phi(3233)}$ is $2753$

Trending Questions

Popular # Hahtags

Popular Questions