Algorithms for relatively cyclotomic primes

DOI10.3233/FI-2013-858MaRDI QIDQ2843822zbMATH OpenOpenAlexFDO

Authors Maciej Grześkowiak

Publication date 26 August 2013

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2013-858

zbMATH Keywords

computing a primitive \(n\)th root of unity modulo primesprimes of a special formpublic key cryptography

Mathematics Subject Classification ID

Cyclotomic extensions (11R18) Number-theoretic algorithms; complexity (11Y16) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient polynomial time algorithms computing industrial-strength primitive roots
• Algorithms for pairing-friendly primes
• scientific article; zbMATH DE number 697832
• Searching for Primitive Roots in Finite Fields
• scientific article; zbMATH DE number 3924863

Cited in

(7)

• Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)
• Comparison of algorithms to calculate quadratic irregularity of prime numbers
• Algorithm for generating primes p and q such that q divides p^4 p^3 + p^2 p + 1
• Primitive prime divisors and the nth cyclotomic polynomial
• scientific article; zbMATH DE number 1186934 (Why is no real title available?)
• On a method to generate odd primes
• Algorithms for pairing-friendly primes

This page was built for publication: Algorithms for relatively cyclotomic primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843822)