Novel Geometric Series for Application of Cryptography

24 August 2023, Version 2
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

This paper presents a novel geometric series along with theorems. These theorems and its results can be used as an application in computing and cryptography to develop algorithms like RSA algorithm and Elliptic Curve Cryptography.

Keywords

computation
theorem
geometric progression

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.