arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1005.3871math.NT
收藏

椭圆曲线的伪素数约化

Pseudoprime reductions of Elliptic curves

Chantal David, Jie Wu

摘要:

设$E$是$\F_p$上的椭圆曲线,不需要复数乘法,对于每个良好约化的素数$p$,设$n_E(p) = | E(\F_p) |$。令$Q_{E,b}(x)$是素数$p \leq x$使得$b^{n_E(p)} \equiv b\,({\rm mod}\,n_E(p))$的数目,并且$π_{E, b}^{\rm pseu}(x)$是{ \it合成} $n_E(p)$使得$b^{n_E(p)} \equiv b\,({\rm mod}\,n_E(p))$的数目(也称为椭圆曲线伪素数)。出于密码学的应用,我们在本文中解决的问题,寻找上界的$Q_{E,b}(x)$和$π_{E, b}^{\rm pseu}(x)$,概括了一些文献的经典伪素数\cite{Erdos56, Pomerance81}这个新的设置。

英文摘要:

Let $E$ be an elliptic curve over $\F_p$ without complex multiplication, and for each prime $p$ of good reduction, let $n_E(p) = | E(\F_p) |$. Let $Q_{E,b}(x)$ be the number of primes $p \leq x$ such that $b^{n_E(p)} \equiv b\,({\rm mod}\,n_E(p))$, and $π_{E, b}^{\rm pseu}(x)$ be the number of {\it compositive} $n_E(p)$ such that $b^{n_E(p)} \equiv b\,({\rm mod}\,n_E(p))$ (also called elliptic curve pseudoprimes). Motivated by cryptography applications, we address in this paper the problem of finding upper bounds for $Q_{E,b}(x)$ and $π_{E, b}^{\rm pseu}(x)$, generalising some of the literature for the classical pseudoprimes \cite{Erdos56, Pomerance81} to this new setting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑