Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2025
|
| Online Access: | https://doi.org/10.5281/zenodo.17802011 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866902054686949376 |
|---|---|
| author | D.T. Muhamediyeva, Tagaev Farkhad Abduvahabovich |
| author_facet | D.T. Muhamediyeva, Tagaev Farkhad Abduvahabovich |
| contents | <p><em><span lang="EN-US">This article presents the NTRU (N-th degree Truncated Polynomial Ring) encryption algorithm and extends the encryption and decryption processes using polynomials. The operation of the encryption and decryption algorithms is carried out by generating random polynomials and converting messages into polynomials. The article discusses the quantum-resistant properties of the NTRU algorithm and how it differs from the classical RSA or elliptic curve algorithms. The importance of the NTRU algorithm and its stability against quantum algorithms for ensuring cryptographic security in the post-quantum era are emphasized. These approaches show the possibilities of countering the threats that arise, especially behind the development of quantum computers. The program shows how encryption works in the Python programming language and using polynomials.</span></em></p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_17802011 |
| institution | Zenodo |
| language | |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | POST-QUANTUM CRYPTOGRAPHY-BASED NTRU ENCRYPTION ALGORITHM AND ENCRYPTION WITH POLYNOMIALS D.T. Muhamediyeva, Tagaev Farkhad Abduvahabovich <p><em><span lang="EN-US">This article presents the NTRU (N-th degree Truncated Polynomial Ring) encryption algorithm and extends the encryption and decryption processes using polynomials. The operation of the encryption and decryption algorithms is carried out by generating random polynomials and converting messages into polynomials. The article discusses the quantum-resistant properties of the NTRU algorithm and how it differs from the classical RSA or elliptic curve algorithms. The importance of the NTRU algorithm and its stability against quantum algorithms for ensuring cryptographic security in the post-quantum era are emphasized. These approaches show the possibilities of countering the threats that arise, especially behind the development of quantum computers. The program shows how encryption works in the Python programming language and using polynomials.</span></em></p> |
| title | POST-QUANTUM CRYPTOGRAPHY-BASED NTRU ENCRYPTION ALGORITHM AND ENCRYPTION WITH POLYNOMIALS |
| url | https://doi.org/10.5281/zenodo.17802011 |