https://github.com/sukumar1210/ntrupy
NTRU (N'th Degree Truncated Polynomial Ring Unit) is a Post Quantum Cryptographic System. Post-Quantum refers to the Cryptographic Encryption and Decryption that could be used after the widespread access to the Quantum computers become common.
https://github.com/sukumar1210/ntrupy
cryptography quantum security
Last synced: about 1 year ago
JSON representation
NTRU (N'th Degree Truncated Polynomial Ring Unit) is a Post Quantum Cryptographic System. Post-Quantum refers to the Cryptographic Encryption and Decryption that could be used after the widespread access to the Quantum computers become common.
- Host: GitHub
- URL: https://github.com/sukumar1210/ntrupy
- Owner: sukumar1210
- License: gpl-3.0
- Created: 2023-11-27T08:31:39.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-02-15T06:52:42.000Z (over 2 years ago)
- Last Synced: 2025-02-07T18:24:30.449Z (over 1 year ago)
- Topics: cryptography, quantum, security
- Language: Python
- Homepage:
- Size: 56.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.txt
Awesome Lists containing this project
README
# Table of contents
- [What is NTRU?](#what-is-ntru)
- [Usage of this Python Module](#module-usage)
- [Docs](#other-docs)
- [Algorithm](./Docs/NTRU%20Algorithm.md)
- [Mathematical Requirements](./Docs/Required%20Mathematics%20for%20NTRU.md)
# What is NTRU?
[NTRU](https://en.wikipedia.org/wiki/NTRU) (N'th Degree Truncated Polynomial Ring Unit) is a Post Quantum Cryptographic System. Post-Quantum refers to the Cryptographic Encryption and Decryption that could be used after the widespread access to the Quantum computers become common.
## Need for a different (Post-Quantum) Cryptographic System.
The Current Cryptographic systems work on the NP-Hard problem of Factoring products of large Prime numbers, i.e. the difficulty and complexity of factorising the products of two large prime numbers is non-computable for a classical computer system.
#### Problem
These Classical Cryptographic systems can be broken using a quantum computer as the product of the large prime numbers can be factorised using [Shor's Algorithm](https://en.wikipedia.org/wiki/Shor%27s_algorithm#:~:text=%22Shor's%20algorithm%22%20usually%20refers%20to,of%20the%20hidden%20subgroup%20problem.) on a Quantum Computer.
#### Solution
The solution is to come up with a different Cryptographic System which is based on either a different NP-Hard Problem or a completely different mathematical paradigm which maps the plain-text to the cipher-text in a manner which is not traceable.
# Module Usage
TBC
# Other Docs
- [NTRU Algorithm](./Docs/NTRU%20Algorithm.md)
- Key-Generation
- Encryption
- Decryption