Home/ Questions/Q 6881449
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-27T05:06:32+00:00

I learn cryptography at my university, and I need to make an application for

  • 0

I learn cryptography at my university, and I need to make an application for testing numbers as prime numbers.

I must to do it using Lehmann Test, but I don’t know anything about it. Please, describe me the algorithm or give me an example (Java, C#, C++, etc). Thank you for helping.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Let’s call PP your Potential Prime.

    • (1) Choose a random number a less than PP.
    • (2) Calculate a^(p-1)/2 mod PP.
    • (3) If a^(PP-1)/2 /= 1 or -1 (mod PP), then PP is not prime.
    • (4) If a^(PP-1)/2 = 1 or -1 (mod PP), then the probability that PP is not prime is less than 50%.
    • 0