Patent ID: 11917047
Assignee: nan
Field: Digital communication (Electrical engineering)
Classification: CPC G  H | IPC H

Claim 0:
1. A method of encryption, the “Elusive Key” cipher, wherein a cryptographic key is upgraded into a secret size, secret geometry, secret content mathematical construct regarded as the “Elusive Key” or the “Rock”, and where randomized parts of the Elusive Key or the Rock are used for each instant of encryption, comprising:
by a computing device:
(i) the Elusive Key or the Rock is constructed by populating k locations of a physical device implementation or a computer memory implementation of the Elusive Key (Rock), called “bins”, of an N-dimensional array, with letters of a plaintext alphabet, P, comprising n letters p1, p2, . . . pn, indicating the bins each contains a letter from P, or are marked by a letter from P, and where each bin has e=3N−1 connections, called ‘edges’ to e neighboring bins:
(ii) utilizing “Walk” encryption, the edges are each marked with letters of a ciphertext alphabet C, comprising m letters c1, c2, . . . cm, where m≥e and no two edges emanating from the same bin are marked by the same ciphertext letter;
(iii) Walk encryption further uses a plaintext message M, comprising t plaintext letters mi, m2, . . . mt by order as a “travel guide” along the Rock, by randomly selecting a starting bin for the travel, an anchor bin, then using M to mark a bin to bin travel path, Tp, on the Rock (the Elusive Key), then expressing the resulting travel path, Tp, by specifying the location of the anchor bin, A, on the Rock, and listing the edges that comprise the travel path, Tc,
with a transmitter passing to a recipient the address of the anchor, A, and Tc;
(iv) “Walk” decryption is implemented by the recipient sharing the Rock, by using Tc and A to mark the travel path on the Rock, then reading the sequence of bins that comprise the travel path, thereby listing Tp=M;
(v) Rock encryption is implemented by using a key sequencing procedure called “Snail” which lists all the k bins of the key, the Rock, by a certain order, creating a “Snail Curve” and where this order can start with an arbitrary bin of the key (marked as bin 1) and where this order refers to any of the k bins as bin-i, for i=1,2, . . . k, and where every bin listed at position i (1≤i≤k) has an edge pointing at bin-(i+1),
with the transmitter randomly selecting anchor, Aj, then counting sj steps on the Snail curve for which bin-1=Aj; where these s1 steps lead to a bin containing plaintext letter mj∈P, where mj is the j-th letter in M, so doing for j=1,2, . . . t;
with the transmitter passing to the recipient the t anchors A1, A2, . . . At, and t step counts s1, s2, . . . st; and
(vi) Rock decryption is implemented by the Rock-sharing recipient, marking Aj on the Rock, building the Snail curve with Aj as bin-1, then counting sj steps on the Snail curve to land at a bin that contains plaintext letter mj, which is the j-th letter in M, so doing for j=1,2, . . . t, then stringing letters mj by order j=1,2, . . . t to build M.