2012/08/09 by Krishnama Raju Kanchu, Kanchu, Krishnama Raju, Subhash Kak +1
Computer Science · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR
paper · pdf · doi:10.48550/arxiv.1208.1984
8 pages, 5 figures, 4 tables
arxiv created 2012/08/09 · arxiv updated 2012/08/10
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.