Question

Apply Chinese Remainder Theorem to solve Discrete Logarithm Problem

score 942 · Answer 1 · 2017-11-19 15:42:25

942

Views

Apply Chinese Remainder Theorem to solve Discrete Logarithm Problem

Published on 19 Nov 2017 - 15:42

score 97 · Answer 2 · 2017-11-24 11:53:04

97

Views

Polig-helman - solving $3^x = 5 \pmod{113}$ - 2 methods give different values for $x_1$ for $40^x=42$

Published on 24 Nov 2017 - 11:53

score 71 · Answer 3 · 2017-11-26 01:27:53

71

Views

Is finding "a" given g, g^a, and g^(a^-1) mod p intractable?

Published on 26 Nov 2017 - 1:27

score 30 · Answer 4 · 2017-12-01 12:29:59

30

Views

Continuous functions $F(x)$ that satisfy: period of $x$ divides $F(x)$ for all values of $x$

Published on 01 Dec 2017 - 12:29

score 115 · Answer 5 · 2017-12-03 10:55:28

115

Views

Polig-helman algorithm - if $g$ is a prim root mod $p$ does this mean that in the subproblems that all $A_i$ are prim roots mod $p$?

Published on 03 Dec 2017 - 10:55

score 440 · Answer 6 · 2017-12-21 23:00:25

440

Views

Why does $(g^a \bmod n)^b = (g^b \bmod n)^a = g^{ab} \bmod n $?

Published on 21 Dec 2017 - 23:00

score 339 · Answer 7 · 2018-01-07 08:19:12

339

Views

Use pohlig-hellam algorithm to solve discrete log whose modulus is a primorial number

Published on 07 Jan 2018 - 8:19

score 53 · Answer 8 · 2018-01-10 00:20:37

53

Views

Find closed sequences of $y= \lceil log_2 x\rceil$ function

Published on 10 Jan 2018 - 0:20

score 441 · Answer 9 · 2010-12-20 01:15:05

441

Views

Discrete logarithm to a primitive root base

Published on 20 Dec 2010 - 1:15

score 1k · Answer 10 · 2011-09-11 10:48:49

1k

Views

Groups where discrete logarithm is hard

Published on 11 Sep 2011 - 10:48

score 216 · Answer 11 · 2012-04-19 18:36:33

216

Views

Discrete log of consecutive numbers

Published on 19 Apr 2012 - 18:36

score 146 · Answer 12 · 2020-08-12 09:54:04

146

Views

Definition of finite field with fixed characteristic

Published on 12 Aug 2020 - 9:54

score 147 · Answer 13 · 2020-08-29 09:21:32

147

Views

Determine dlog in quotient rings of polynomial rings

Published on 29 Aug 2020 - 9:21

score 143 · Answer 14 · 2020-09-04 05:07:24

143

Views

Parity of discrete logarithms is independent of base

Published on 04 Sep 2020 - 5:07

score 25 · Answer 15 · 2020-09-21 19:58:59

25

Views

In $Z_{p^e}^*$, why is $p$-adic presentation of $x = \sum_{i=0}^{e-1} x_i p^{i}$, why is $g^{p_e(x_1 + \dots + x_{e_1} p^{e-2})} = 1$

Published on 21 Sep 2020 - 19:58

List Question

Apply Chinese Remainder Theorem to solve Discrete Logarithm Problem

Polig-helman - solving $3^x = 5 \pmod{113}$ - 2 methods give different values for $x_1$ for $40^x=42$

Is finding "a" given g, g^a, and g^(a^-1) mod p intractable?

Continuous functions $F(x)$ that satisfy: period of $x$ divides $F(x)$ for all values of $x$

Polig-helman algorithm - if $g$ is a prim root mod $p$ does this mean that in the subproblems that all $A_i$ are prim roots mod $p$?

Why does $(g^a \bmod n)^b = (g^b \bmod n)^a = g^{ab} \bmod n $?

Use pohlig-hellam algorithm to solve discrete log whose modulus is a primorial number

Find closed sequences of $y= \lceil log_2 x\rceil$ function

Discrete logarithm to a primitive root base

Groups where discrete logarithm is hard

Discrete log of consecutive numbers

Definition of finite field with fixed characteristic

Determine dlog in quotient rings of polynomial rings

Parity of discrete logarithms is independent of base

In $Z_{p^e}^*$, why is $p$-adic presentation of $x = \sum_{i=0}^{e-1} x_i p^{i}$, why is $g^{p_e(x_1 + \dots + x_{e_1} p^{e-2})} = 1$

Trending Questions

Popular # Hahtags

Popular Questions