Efficient Rsa Prime Generation Using Vedic Mathematics Divisibility Ruless
Author : Deepak kumar Journa Name: International Journal of Scientific Research & Engineering Trends Volume: 12 issue: 2 Year: Volume-12-issue-2 Views : 198I wondered if ancient Vedic mathematics could speed up modern RSA cryptography. RSA needs large prime numbers, but finding them takes time. Vedic divisibility rules (mod 3, 7, 11 flags) reject 90% of wrong candidates instantly. My tests show 4.3x speedup for 120-bit primes. This bridges 5000-year-old Indian math with 21st-century security.
Related Indexing Platform
Indexed Journal Website
OAI
https://abcdindex.com/Q745YUJGHTHWE77/ajax/paper_indexing_from_deng.php?verb=GetRecord&identifier=oai%3Aabcdindex.com%3Aarticle%3A65119&metadataPrefix=oai_dc
ABCDIndex OAI-PMH
Dublin Core metadata (harvesters)
GS
Search on Google Scholar
Google Scholar
Search this title on Scholar
SS
Search on Semantic Scholar
Semantic Scholar
Search this title