Research Article

ViJaiPraTap – A Probable Prime Number for Cryptography

by  Vishwas Raval, Prashant Chauhan, Jainam Shah, Tapashree
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 187 - Issue 118
Published: June 2026
Authors: Vishwas Raval, Prashant Chauhan, Jainam Shah, Tapashree
10.5120/ijcaa0b495c6de39
PDF

Vishwas Raval, Prashant Chauhan, Jainam Shah, Tapashree . ViJaiPraTap – A Probable Prime Number for Cryptography. International Journal of Computer Applications. 187, 118 (June 2026), 33-36. DOI=10.5120/ijcaa0b495c6de39

                        @article{ 10.5120/ijcaa0b495c6de39,
                        author  = { Vishwas Raval,Prashant Chauhan,Jainam Shah,Tapashree },
                        title   = { ViJaiPraTap – A Probable Prime Number for Cryptography },
                        journal = { International Journal of Computer Applications },
                        year    = { 2026 },
                        volume  = { 187 },
                        number  = { 118 },
                        pages   = { 33-36 },
                        doi     = { 10.5120/ijcaa0b495c6de39 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2026
                        %A Vishwas Raval
                        %A Prashant Chauhan
                        %A Jainam Shah
                        %A Tapashree
                        %T ViJaiPraTap – A Probable Prime Number for Cryptography%T 
                        %J International Journal of Computer Applications
                        %V 187
                        %N 118
                        %P 33-36
                        %R 10.5120/ijcaa0b495c6de39
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

A probable prime is a number that, based on a certain probabilistic test, is likely but not certain to be prime. Probable primes are frequently used in cryptography and computer science, where large primes are essential but verifying primality can be time-consuming. This paper gives Mersenne’s probable prime number of 79209 digits and how it has been generated, its properties, and their main applications.

References
  • https://www.mersenne.org/
  • https://www.mersenne.org/download/
  • https://sourceforge.net/projects/openpfgw/
  • https://cdac.in/index.aspx?id=hpc_ss_param_shavak
  • http://www.primenumbers.net/prptop/topdisc.php
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Probable prime PRP Mersenne’s prime security cryptography

Powered by PhDFocusTM