Goldbach Ellipse Sequences for Cryptographic Applications

TL;DR

This paper explores the cryptographic potential of Goldbach ellipse sequences, demonstrating their usefulness in key generation, number mapping, and secure session protocols based on Goldbach partitions.

Contribution

It introduces novel cryptographic applications of Goldbach ellipse sequences, including key generation methods and a secure session key protocol.

Findings

Binary subsequences have useful cryptographic properties.

Goldbach ellipse sequences can generate cryptographic keys.

A protocol for secure session keys based on Goldbach partitions.

Abstract

The paper studies cryptographically useful properties of the sequence of the sizes of Goldbach ellipses. We show that binary subsequences based on this sequence have useful properties. They can be used to generate keys and to provide an index-based mapping to numbers. The paper also presents a protocol for secure session keys that is based on Goldbach partitions.