Algorithm for generating primes p and q such that q divides p^4 p^3 + p^2 p + 1

zbMATH Open1262.11105MaRDI QIDQ2883172FDOQ2883172

Authors: Maciej Grześkowiak 

Publication date: 11 May 2012

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: http://iospress.metapress.com/content/52r161kr30848t67/fulltext.html

Recommendations

• Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)
• Algorithms for relatively cyclotomic primes
• Algorithms for pairing-friendly primes
• Prime-number algorithm for public-key systems
• Generating strong primes in RSA cryptosystems

zbMATH Keywords

primes of special formGiuliani-Gong public key system

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Primality (11Y11)

Cited In (1)

• Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)

This page was built for publication: Algorithm for generating primes \(p\) and \(q\) such that \(q\) divides \(p^4 \pm p^3 + p^2 \pm p + 1\)

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