Security

Deterministic Algorithm Computing All Generators: Application in Cryptographic Systems Design

Download Now Free registration required

Executive Summary

Primitive elements play important roles in the Diffie-Hellman protocol for establishment of secret communication keys, in the design of the ElGamal cryptographic system and as generators of pseudo-random numbers. In general, a deterministic algorithm that searches for primitive elements is currently unknown. In information-hiding schemes, where a primitive element is the key factor, there is the freedom in selection of a modulus. This paper provides a fast deterministic algorithm, which computes every primitive element in modular arithmetic with special moduli.

  • Format: PDF
  • Size: 76.68 KB