Question

Is it a coincidence that $8^{73} \bmod{91} = 8^{29} \bmod{72}$ both equal $8$?

score 135 · Answer 1 · 2020-01-28 20:33:21

135

Views

Is it a coincidence that $8^{73} \bmod{91} = 8^{29} \bmod{72}$ both equal $8$?

Published on 28 Jan 2020 - 20:33

score 203 · Answer 2 · 2020-01-30 18:09:54

203

Views

Elliptic Curves over finite field of characteristic p

Published on 30 Jan 2020 - 18:09

score 135 · Answer 3 · 2020-02-02 13:31:27

135

Views

Decrypting the Vigenere cipher ACTMEFPTQBFPLZRDPTQBFH

Published on 02 Feb 2020 - 13:31

score 59 · Answer 4 · 2020-02-05 01:14:19

59

Views

Recovering key without factoring

Published on 05 Feb 2020 - 1:14

score 71 · Answer 5 · 2020-02-06 12:26:52

71

Views

Prove that an algorithm taking $f(k)$ steps to complete run in polynomial time, subexponential time or exponential time, $f(k)=e^{\sqrt {\log k}}$

Published on 06 Feb 2020 - 12:26

score 22 · Answer 6 · 2020-02-08 03:48:55

22

Views

Questions about bilinear pairing operations and how it works.

Published on 08 Feb 2020 - 3:48

score 267 · Answer 7 · 2020-02-09 15:08:26

267

Views

Number of try for $p$ and $q$ to find $m$(Brute-force a RSA key)

Published on 09 Feb 2020 - 15:08

score 74 · Answer 8 · 2026-02-23 08:30:36

74

Views

How to prove statement about octal numbers

Published on 23 Feb 2026 - 8:30

score 95 · Answer 9 · 2026-02-23 04:06:03

95

Views

Is there a standard name for "signed distance to the nearest integer" that's reasonably succinct?

Published on 23 Feb 2026 - 4:06

score 75 · Answer 10 · 2020-02-16 10:04:47

75

Views

Permutation of first $k$ prime powers as a one-way function?

Published on 16 Feb 2020 - 10:04

score 59 · Answer 11 · 2020-02-17 19:00:57

59

Views

Given $N$, $m$ and $Q$, find an elliptic curve $E$ and a point $P$ such that $Q=[m]P$ over $E(\mathbb{Z}/N\mathbb{Z})$.

Published on 17 Feb 2020 - 19:00

score 41 · Answer 12 · 2020-02-18 16:20:56

41

Views

Using RSA, and stumbles upon secret exponent: find primefactorization

Published on 18 Feb 2020 - 16:20

score 75 · Answer 13 · 2020-02-21 17:19:28

75

Views

Am i able to calculate ($a^{bc}$ mod d) with ($a^{b}$ mod d) and ($a^{c}$ mod d) without knowing a power?

Published on 21 Feb 2020 - 17:19

score 68 · Answer 14 · 2026-03-26 01:02:08

68

Views

Lyapunov exponent relationship with chaotic behavior

Published on 26 Mar 2026 - 1:02

score 64 · Answer 15 · 2020-02-27 03:24:56

64

Views

Prove that if $S \circ S$ has perfect secrecy, then $S$ has perfect secrecy

Published on 27 Feb 2020 - 3:24

List Question

Is it a coincidence that $8^{73} \bmod{91} = 8^{29} \bmod{72}$ both equal $8$?

Elliptic Curves over finite field of characteristic p

Decrypting the Vigenere cipher ACTMEFPTQBFPLZRDPTQBFH

Recovering key without factoring

Prove that an algorithm taking $f(k)$ steps to complete run in polynomial time, subexponential time or exponential time, $f(k)=e^{\sqrt {\log k}}$

Questions about bilinear pairing operations and how it works.

Number of try for $p$ and $q$ to find $m$(Brute-force a RSA key)

How to prove statement about octal numbers

Is there a standard name for "signed distance to the nearest integer" that's reasonably succinct?

Permutation of first $k$ prime powers as a one-way function?

Given $N$, $m$ and $Q$, find an elliptic curve $E$ and a point $P$ such that $Q=[m]P$ over $E(\mathbb{Z}/N\mathbb{Z})$.

Using RSA, and stumbles upon secret exponent: find primefactorization

Am i able to calculate ($a^{bc}$ mod d) with ($a^{b}$ mod d) and ($a^{c}$ mod d) without knowing a power?

Lyapunov exponent relationship with chaotic behavior

Prove that if $S \circ S$ has perfect secrecy, then $S$ has perfect secrecy

Trending Questions

Popular # Hahtags

Popular Questions