Goldbach Ellipse Sequences for Cryptographic Applications
This work addresses cryptographic key generation for secure communications, but appears incremental as it builds on known concepts like Goldbach partitions without claiming major breakthroughs.
The paper tackled the problem of generating cryptographic keys by studying the sequence of Goldbach ellipse sizes, showing that binary subsequences derived from it have useful properties for key generation and index-based mapping, and presented a protocol for secure session keys based on Goldbach partitions.
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.