Encryption method using geometric encryption and geometric random number generation

{
  "publication_number": "US2026106741A1",
  "country": "US",
  "kind": "A1",
  "title": "Encryption method using geometric encryption and geometric random number generation",
  "abstract": "The present invention is an encryption method utilizing a novel random number generator and geometric fields to create encryption keys. The novel random number generator uses geometric graph sampling and cellular automaton distributions to generate random number sets suitable for encryption use. The encryption method portion uses graph analysis to create elliptic curves suitable for encryption key generation.",
  "claims": [
    "1. The present invention is a method for strengthening cryptographic systems using randomly generated numbers, graphs, and curves in encryption key generation. This method increases cryptographic complexity."
  ],
  "description_excerpt": "The present method invention relates to cryptography and encryption of data.\n\nCryptography is developed from the idea the key you use to encrypt data can be shared publicly and executed privately. This encryption requires a series of equations easy to execute but difficult to reverse. The difference between ease in executing a method in one direction and difficulty in reversal of the method is considered the overall strength of a cryptographic system. Most current cryptographic systems utilize either multiplication of random numbers with the strength of encryption depending on the difficulty of factoring or breakdown of the multiplication or the generation of an encryption key using graphical curve equations for random variables. Modern electronic systems have reduced ability to process large numbers which limits the potential length of encryption keys available to cryptographic systems.\n\nThe present invention is a method which increases the strength of encryption while reducing the time complexity needed for computation. This cryptographic system uses the following steps:\n\nThe present invention can use random number generation, mathematical equations, graphs, and curves to establish an encryption key. These include, but are not limited to, geometric equations, graph theory, and elliptic curves.\n\nA new method of encryption is created which allows users to strengthen data protection through graph randomization while maintaining limited time complexity for computation. This method gives users stronger encryption without requiring increased computational ability or time requirements.",
  "cpc": [
    "H04L 9/0869"
  ],
  "ipc": [
    "H04L 9/08"
  ],
  "inventors": [
    "Leith Tidwell"
  ],
  "filing_date": "2024-10-11",
  "publication_date": "2026-04-16",
  "priority_date": "2024-07-16",
  "application_number": "US-202418914001-A",
  "family_id": "99436457",
  "cited_by_count": 0,
  "citations": [
    "US20240223368A1"
  ]
}