Authors: Deepak kumar
Abstract: I 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.
DOI:
