Prime numbers are fundamental to the most common type of asymmetric encryption used today, namely Diffie-Hellman key exchange, Rivest-Shamir-Adleman cryptosystems, ElGamal Cryptosystem, Elliptic curve cryptosystems, etc.The prime numbers p≥5 obey a pattern that can be described by two forms or geometric progressions 6m+[5,7]→m∈Z^+ or 6k±1→ k∈Z^+ that facilitates obtaining them sequentially, being possible also to calculate the quantity of primes that are in the geometric progressions 6k±1, fore k≥1 as it is described in this document.
Author(S) Details
José William Porras Ferreira
Centro de Investigaciones Cientificas, Escuela Naval de Cadetes “Almirante Padilla”, Isla Manzanillo, Cartagena de Indias, Colombia.
View Book:- https://stm.bookpi.org/RAMRCS-V9/article/view/6024
No comments:
Post a Comment