Affiliation:
1. Zama , Paris , France
2. École normale supérieure , Paris , France
Abstract
Abstract
This paper presents an efficient algorithm for computing 11th-power residue symbols in the cyclo-tomic field
ℚ
(
ζ
11
)
,
$ \mathbb{Q}\left( {{\zeta }_{11}} \right), $
where 11 is a primitive 11th root of unity. It extends an earlier algorithm due to Caranay and Scheidler (Int. J. Number Theory, 2010) for the 7th-power residue symbol. The new algorithm finds applications in the implementation of certain cryptographic schemes.
Subject
Applied Mathematics,Computational Mathematics,Computer Science Applications
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献