Skip to main content
Post Undeleted by VS.
Post Deleted by VS.
deleted 56 characters in body
Source Link
VS.
  • 1.8k
  • 1
  • 10
  • 25

Given an elliptic curve over $\mathbb Z_n$ is it $\#P$ hard to compute

  1. $\# E(\mathbb Z_n)$?

    Is it $\#P$ hard to compute $\# E(\mathbb Z_n)$?

  2. Is it $PP$-hard to compute $\# E(\mathbb Z_n)\leq\frac n2$?

  3. Is it $\oplus P$ hard to compute $\# E(\mathbb Z_n)\bmod 2$?

I doubt the problem is $PP$-hard since it seems unlikely $\# E(\mathbb Z_n)\leq\frac n2$ is exceeded.

Nevertheless is it $\oplus P$ hard to compute

  1. $\# E(\mathbb Z_n)\bmod 2$?

  2. $a\bmod 2$ where $2^a|\# E(\mathbb Z_n)$ and $2^{a+1}\nmid\# E(\mathbb Z_n)$?

Given an elliptic curve over $\mathbb Z_n$ is it $\#P$ hard to compute

  1. $\# E(\mathbb Z_n)$?

I doubt the problem is $PP$-hard since it seems unlikely $\# E(\mathbb Z_n)\leq\frac n2$ is exceeded.

Nevertheless is it $\oplus P$ hard to compute

  1. $\# E(\mathbb Z_n)\bmod 2$?

  2. $a\bmod 2$ where $2^a|\# E(\mathbb Z_n)$ and $2^{a+1}\nmid\# E(\mathbb Z_n)$?

Given an elliptic curve over $\mathbb Z_n$

  1. Is it $\#P$ hard to compute $\# E(\mathbb Z_n)$?

  2. Is it $PP$-hard to compute $\# E(\mathbb Z_n)\leq\frac n2$?

  3. Is it $\oplus P$ hard to compute $\# E(\mathbb Z_n)\bmod 2$?

formatting
Source Link
YCor
  • 63.9k
  • 5
  • 187
  • 286

Counting points in Ellipticelliptic curves

Given an Ellipticelliptic curve over $\mathbb Z_n$ is it $\#P$ hard to compute

  1. $\# E(\mathbb Z_n)$?

I doubt the problem is $PP$-hard since it seems unlikely $\# E(\mathbb Z_n)\leq\frac n2$ is exceeded.

Nevertheless is it $\oplus P$ hard to compute

  1. $\# E(\mathbb Z_n)\bmod 2$?

  2. $a\bmod 2$ where $2^a|\# E(\mathbb Z_n)$ and $2^{a+1}\nmid\# E(\mathbb Z_n)$?

Counting points in Elliptic curves

Given an Elliptic curve over $\mathbb Z_n$ is it $\#P$ hard to compute

  1. $\# E(\mathbb Z_n)$?

I doubt the problem is $PP$-hard since it seems unlikely $\# E(\mathbb Z_n)\leq\frac n2$ is exceeded.

Nevertheless is it $\oplus P$ hard to compute

  1. $\# E(\mathbb Z_n)\bmod 2$?

  2. $a\bmod 2$ where $2^a|\# E(\mathbb Z_n)$ and $2^{a+1}\nmid\# E(\mathbb Z_n)$?

Counting points in elliptic curves

Given an elliptic curve over $\mathbb Z_n$ is it $\#P$ hard to compute

  1. $\# E(\mathbb Z_n)$?

I doubt the problem is $PP$-hard since it seems unlikely $\# E(\mathbb Z_n)\leq\frac n2$ is exceeded.

Nevertheless is it $\oplus P$ hard to compute

  1. $\# E(\mathbb Z_n)\bmod 2$?

  2. $a\bmod 2$ where $2^a|\# E(\mathbb Z_n)$ and $2^{a+1}\nmid\# E(\mathbb Z_n)$?

Source Link
VS.
  • 1.8k
  • 1
  • 10
  • 25

Counting points in Elliptic curves

Given an Elliptic curve over $\mathbb Z_n$ is it $\#P$ hard to compute

  1. $\# E(\mathbb Z_n)$?

I doubt the problem is $PP$-hard since it seems unlikely $\# E(\mathbb Z_n)\leq\frac n2$ is exceeded.

Nevertheless is it $\oplus P$ hard to compute

  1. $\# E(\mathbb Z_n)\bmod 2$?

  2. $a\bmod 2$ where $2^a|\# E(\mathbb Z_n)$ and $2^{a+1}\nmid\# E(\mathbb Z_n)$?