Improve the public key schemes by using keys based on different polynomials
DOI:
https://doi.org/10.61841/k8dhb452Keywords:
Polynomial, RSA, Euler function, T Okamoto.Abstract
Many researchers have studied the development and updating of RSA method and methods with the key, where these methods depend on the powers and confidentiality of the keys. In our research, we worked on these keys, which are numbers and for confidentiality we treated them as polynomial where the recipient of the cipher worked to solve them and return them as numbers. These polynomials were built with specific theories based on partial differential equations where they gave positive results achieved through examples.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
