Generating elements of orders dividing p6 ± p5 + p4 ± p3 + p2 + p ± 1
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.
Full Text:
PDFDOI: http://dx.doi.org/10.2478/v10065-011-0008-5
Date of publication: 2011-01-01 00:00:00
Date of submission: 2016-04-28 09:03:48
Statistics
Total abstract view - 372
Downloads (from 2020-06-17) - PDF - 0
Indicators
Refbacks
- There are currently no refbacks.
Copyright (c) 2015 Annales UMCS Sectio AI Informatica
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.