Generating elements of orders dividing p^6 p^5 + p^4 p^3 + p^2 +1

DOI10.2478/V10065-011-0008-5MaRDI QIDQ2442945zbMATH OpenOpenAlexFDO

Authors Maciej Grześkowiak

Publication date 2 April 2014

Published in Annales Universitatis Mariae Curie-Sklodowska, sectio AI – Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.2478/v10065-011-0008-5

Mathematics Subject Classification ID

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

Recommendations

• Algorithm for generating primes p and q such that q divides p^4 p^3 + p^2 p + 1
• On the construction of finite field elements of large order
• Algorithms for relatively cyclotomic primes
• Generating Large Instances of the Gong-Harn Cryptosystem
• Analysis of algorithms of generating key parameters for the XTR cryptosystems

Cites work

• scientific article; zbMATH DE number 45834 (Why is no real title available?)
• scientific article; zbMATH DE number 1759768 (Why is no real title available?)
• New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
• Public-key cryptosystems based on cubic finite field extensions

Cited in

(2)

• Algorithm for generating primes p and q such that q divides p^4 p^3 + p^2 p + 1
• Generating Large Instances of the Gong-Harn Cryptosystem

This page was built for publication: Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)

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