Generating elements of orders dividing p6 ± p5 + p4 ± p3 + p2 + p ± 1

Authors:
Maciej Grześkowiak
Affiliations:
Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Umultowska 87, 61-614 Poznań, Poland
Venue:
Annales UMCS, Informatica - Cryptography and data protection
Year:
2011

Citing 3
Cited 1

The XTR Public Key System

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP)

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Public-key cryptosystems based on cubic finite field extensions

IEEE Transactions on Information Theory

Algorithms for Relatively Cyclotomic Primes

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose an algorithm for computing large primes p and q such that q divides p6 + p5 + p4 + p3 + p2 + p + 1 or p6-p5 + p4-p3 + p2-p + 1. Such primes are the key parameters for the cryptosystem based on the 7th order characteristic sequences.