Factorials and Integers for Applications in Computing and Cryptography
Chinnaraji Annamalai
Abstract
Mathematical formulae with integers or prime numbers are used as cryptographic algorithms like RSA algorithm and elliptic-curve cryptography. These methodological advances in computational science and mathematics play a vital role in communication and cybersecurity. This article is prepared for applications in computing and cybersecurity using the theorems in factorials and binomial identity. Also, this paper focuses on the analysis of relationship between factorials and integers.
Topics & Concepts
CryptographyPrime (order theory)Elliptic curve cryptographyNumber theoryPrime numberMathematicsTheoretical computer scienceIdentity (music)Binomial coefficientComputer scienceElliptic curveDiscrete mathematicsArithmeticPublic-key cryptographyComputer securityCombinatoricsEncryptionPure mathematicsAcousticsPhysicsChaos-based Image/Signal EncryptionCryptography and Residue ArithmeticCoding theory and cryptography