Question

How to obtain private key of Elliptic curve by factorization?

score 38 · Answer 1 · 2019-02-16 16:17:47

38

Views

How to obtain private key of Elliptic curve by factorization?

Published on 16 Feb 2019 - 16:17

score 102 · Answer 2 · 2026-03-25 19:04:59

102

Views

Number of points needed to determine a sparse univariate polynomial over a large prime field with known support

Published on 25 Mar 2026 - 19:04

score 193 · Answer 3 · 2019-02-20 19:51:59

193

Views

RSA - Under What Circumstances does Encryption Key Also Decrypt Cyphertext?

Published on 20 Feb 2019 - 19:51

score 858 · Answer 4 · 2019-02-21 20:51:07

858

Views

Can you please solve $7^{-1} \mod 480$ using extended Euclidean Algorithm?. Kindly show the steps till end

Published on 21 Feb 2019 - 20:51

score 239 · Answer 5 · 2019-02-23 18:23:42

239

Views

Square Root Mod

Published on 23 Feb 2019 - 18:23

score 97 · Answer 6 · 2019-02-23 21:04:19

97

Views

Are there solutions to $x^2 = 171\pmod{203}$?

Published on 23 Feb 2019 - 21:04

score 95 · Answer 7 · 2019-02-23 22:56:25

95

Views

Cryptology Proof

Published on 23 Feb 2019 - 22:56

score 147 · Answer 8 · 2019-02-23 23:12:16

147

Views

Show that an Affine Cipher with a prime modulo $N$ fixes exactly one plaintext message $m$ in $\mathcal M$

Published on 23 Feb 2019 - 23:12

score 22 · Answer 9 · 2026-03-25 15:54:34

22

Views

Translating binary plaintext into alphabetic plaintext using an $18$-digit base-$26$ integer system

Published on 25 Mar 2026 - 15:54

score 67 · Answer 10 · 2019-02-24 20:03:34

67

Views

Decrypting an Affine Cipher $ e(m)=am+b\pmod{27}$ knowing $e(8)\equiv 14$ and $e(26)\equiv 5$

Published on 24 Feb 2019 - 20:03

score 291 · Answer 11 · 2019-02-24 21:47:25

291

Views

RSA Cryptography and grouping integers

Published on 24 Feb 2019 - 21:47

score 68 · Answer 12 · 2019-02-25 18:19:40

68

Views

Show the affine cipher $e(m)=am$ fixes at least two messages in $\mathcal M=\mathbb Z/N\mathbb Z$

Published on 25 Feb 2019 - 18:19

score 156 · Answer 13 · 2019-02-26 04:39:39

156

Views

Solve for $x, \;23+35 x ≡ 4$ (mod $ 13)$

Published on 26 Feb 2019 - 4:39

score 267 · Answer 14 · 2019-02-27 04:53:38

267

Views

Irreducible Polynomial of Galois field

Published on 27 Feb 2019 - 4:53

score 66 · Answer 15 · 2026-03-25 17:21:49

66

Views

Find all pairs of positive integers $(x, y)$ for which $261x + 48y = 7881$

Published on 25 Mar 2026 - 17:21

List Question

How to obtain private key of Elliptic curve by factorization?

Number of points needed to determine a sparse univariate polynomial over a large prime field with known support

RSA - Under What Circumstances does Encryption Key Also Decrypt Cyphertext?

Can you please solve $7^{-1} \mod 480$ using extended Euclidean Algorithm?. Kindly show the steps till end

Square Root Mod

Are there solutions to $x^2 = 171\pmod{203}$?

Cryptology Proof

Show that an Affine Cipher with a prime modulo $N$ fixes exactly one plaintext message $m$ in $\mathcal M$

Translating binary plaintext into alphabetic plaintext using an $18$-digit base-$26$ integer system

Decrypting an Affine Cipher $ e(m)=am+b\pmod{27}$ knowing $e(8)\equiv 14$ and $e(26)\equiv 5$

RSA Cryptography and grouping integers

Show the affine cipher $e(m)=am$ fixes at least two messages in $\mathcal M=\mathbb Z/N\mathbb Z$

Solve for $x, \;23+35 x ≡ 4$ (mod $ 13)$

Irreducible Polynomial of Galois field

Find all pairs of positive integers $(x, y)$ for which $261x + 48y = 7881$

Trending Questions

Popular # Hahtags

Popular Questions