Question

Does $O(log \ n)$ (space) equality testing of $n$-bit integers using $f(x) = x \ mod \ p$ fingerprinting work for negative integers as well?

score 44 · Answer 1 · 2019-01-05 12:05:59

44

Views

Does $O(log \ n)$ (space) equality testing of $n$-bit integers using $f(x) = x \ mod \ p$ fingerprinting work for negative integers as well?

Published on 05 Jan 2019 - 12:05

score 66 · Answer 2 · 2019-01-08 07:56:55

66

Views

Proof of construction of a matrix

Published on 08 Jan 2019 - 7:56

score 278 · Answer 3 · 2019-01-08 17:58:35

278

Views

how to find the generator of elliptic curve using matlab

Published on 08 Jan 2019 - 17:58

score 152 · Answer 4 · 2019-01-09 13:38:09

152

Views

For $n \ge 20$, there are at least $0.6 \cdot \frac{2^n}{n}$ primes in $\left[2^{n-1},2^n - 1\right]$.

Published on 09 Jan 2019 - 13:38

score 44 · Answer 5 · 2019-01-10 20:55:44

44

Views

How to solve $x^r [ x^n + 1] = x^{r[n]}$

Published on 10 Jan 2019 - 20:55

score 111 · Answer 6 · 2026-03-22 19:26:02

111

Views

solutions of gold APN functions using trace function

Published on 22 Mar 2026 - 19:26

score 331 · Answer 7 · 2026-03-25 23:36:14

331

Views

Generating random (torsion) point on elliptic curve efficiently

Published on 25 Mar 2026 - 23:36

score 77 · Answer 8 · 2019-01-17 13:57:47

77

Views

Strictly less then $o$ noation.

Published on 17 Jan 2019 - 13:57

score 187 · Answer 9 · 2026-02-23 02:52:54

187

Views

Is wikipedia Pollard's rho algorithm for logarithms wrong?

Published on 23 Feb 2026 - 2:52

score 325 · Answer 10 · 2019-01-18 12:42:16

325

Views

Centered and bounded implies subgaussian

Published on 18 Jan 2019 - 12:42

score 150 · Answer 11 · 2019-01-21 16:21:52

150

Views

For a strong prime $p = kq+1$, $\langle g^k \rangle \le \mathbb{QR}_p$

Published on 21 Jan 2019 - 16:21

score 3k · Answer 12 · 2019-01-22 09:22:57

3k

Views

How can I break RSA if I know the private key?

Published on 22 Jan 2019 - 9:22

score 452 · Answer 13 · 2019-01-22 16:05:19

452

Views

What does affine equivalence mean in the context of cryptographic boolean functions?

Published on 22 Jan 2019 - 16:05

score 391 · Answer 14 · 2026-02-23 03:01:43

391

Views

In Mathematics is there a discrete logarithm function?

Published on 23 Feb 2026 - 3:01

score 67 · Answer 15 · 2019-01-24 16:42:16

67

Views

2 sequences defined as (really untrivial) limits

Published on 24 Jan 2019 - 16:42

List Question

Does $O(log \ n)$ (space) equality testing of $n$-bit integers using $f(x) = x \ mod \ p$ fingerprinting work for negative integers as well?

Proof of construction of a matrix

how to find the generator of elliptic curve using matlab

For $n \ge 20$, there are at least $0.6 \cdot \frac{2^n}{n}$ primes in $\left[2^{n-1},2^n - 1\right]$.

How to solve $x^r [ x^n + 1] = x^{r[n]}$

solutions of gold APN functions using trace function

Generating random (torsion) point on elliptic curve efficiently

Strictly less then $o$ noation.

Is wikipedia Pollard's rho algorithm for logarithms wrong?

Centered and bounded implies subgaussian

For a strong prime $p = kq+1$, $\langle g^k \rangle \le \mathbb{QR}_p$

How can I break RSA if I know the private key?

What does affine equivalence mean in the context of cryptographic boolean functions?

In Mathematics is there a discrete logarithm function?

2 sequences defined as (really untrivial) limits

Trending Questions

Popular # Hahtags

Popular Questions