MUMBAI, India, Feb. 27 -- Intellectual Property India has published a patent application (202641017017 A) filed by Dr. L Sudha Rani; Amith Pradhaan; Shiny R M; Dr Nageswararao Sirisala; B. Rekhadevi; Debayan Bhowmik; Dr Hemantkumar Balasaheb Jadhav; and Bappa Mondal, Kurnool, Andhra Pradesh, on Feb. 16, for 'quantum-resistant cryptographic authentication system.'
Inventor(s) include Dr. L Sudha Rani; Amith Pradhaan; Shiny R M; Dr Nageswararao Sirisala; B. Rekhadevi; Debayan Bhowmik; Dr Hemantkumar Balasaheb Jadhav; and Bappa Mondal.
The application for the patent was published on Feb. 27, under issue no. 09/2026.
According to the abstract released by the Intellectual Property India: "Quantum-Resistant Cryptographic Authentication System ABSTRACT: Quantum-resistant cryptography, often known as post-quantum cryptography, denotes a novel category of data security designed to safeguard information against quantum computers. Contemporary digital security solutions predominantly depend on mathematical problems that are not readily solvable by the majority of computers. For instance, two conventional encryption techniques, RSA and Elliptic Curve Cryptography (ECC), safeguard data by rendering it virtually infeasible for computers to ascertain the correct encryption key within a specified timeframe. Nonetheless, quantum computers present a novel challenge to these conventional security systems. To address this security issue, quantum-resistant encryption has been developed to endure the computing capabilities of quantum computers by utilizing distinct, more intricate mathematical challenges. Quantum-resistant encryption seeks to safeguard data security in anticipation of the widespread adoption of quantum computers. Quantum-resistant cryptography functions by substituting mathematical problems that quantum computers can efficiently resolve with novel, more complex forms of questions. These issues constitute the basis of numerous quantum-resistant cryptographic techniques. Lattice-based cryptography is a prevalent quantum-resistant technique and a favored alternative to conventional cryptographic methods. This approach depends on lattices, intricate mathematical constructs created by vector combinations, and necessitates computational resources to address challenges like identifying the shortest or nearest vector within the lattice. Examples of lattice-based algorithms specified by NIST are the ML-KEM (Module-Lattice-Based Key Encapsulation Mechanism) and ML-DSA (Module-Lattice-Based Digital Signature Algorithm). For outdated infrastructures, firms may necessitate updates to fully leverage modern solutions. A further problem is the long-term reliability of quantum-resistant methods. As quantum-resistant encryption progresses, so too may quantum computing, necessitating that cybersecurity researchers and developers consistently update and substitute methods. Nonetheless, despite obstacles, quantum-resistant encryption continues to serve as a viable short-term option for safeguarding against quantum attacks and holds potential for ensuring data security."
Disclaimer: Curated by HT Syndication.
