The Eleventh Power Residue Symbol-Reference-Cited by-同舟云学术

The Eleventh Power Residue Symbol

Published:2020-11-17 Issue:1 Volume:15 Page:111-122
ISSN:1862-2984
Container-title:Journal of Mathematical Cryptology
language:en
Short-container-title:

Author:

Joye Marc¹,Lapiha Oleksandra²,Nguyen Ky²,Naccache David²

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.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Computational Mathematics,Computer Science Applications

Link

https://www.degruyter.com/document/doi/10.1515/jmc-2020-0077/pdf

Reference19 articles.

1. William D. Banks, Daniel Lieman and Igor E. Shparlinski, An extremely small and efficient identification scheme, in: Information Security and Privacy (ACISP 2000) (E. Dawson et al., eds.), Lecture Notes in Computer Science 1841, pp. 378–384, Springer, 2000.

2. Éric Brier, Houda Ferradi, Marc Joye and David Naccache, New number-theoretic cryptographic primitives, Journal of Mathematical Cryptology (To appear).

3. Perlas C. Caranay and Renate Scheidler, An efficient seventh power residue symbol algorithm, International Journal of Number Theory 6 (2010), 1831–1853.

4. Ivan Bjerre Damgård and Gudmund Skovbjerg Frandsen, Eflcient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers, Journal of Symbolic Computation 39 (2005), 643–652.

5. Koen de Boer and Carlo Pagano, Calculating the power residue symbol and ibeta: Applications of computing the group structure of the principal units of a p-adic number field completion, in: 42nd International Symposium on Symbolic and Algebraic Computation (M. A. Burr et al., eds.), pp. 117–124, ACM, 2017.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Batch point compression in the context of advanced pairing-based protocols;Applicable Algebra in Engineering, Communication and Computing;2023-10-04

2. Subgroup membership testing on elliptic curves via the Tate pairing;Journal of Cryptographic Engineering;2022-09-02

3. Efficient Generation of Roots of Power Residues Modulo Powers of Two;Mathematics;2022-03-11