Need software for running primality checks.

  • Thread starter Thread starter mesa
  • Start date Start date
  • Tags Tags
    Running Software
AI Thread Summary
The discussion centers on the need for software to perform primality checks on large primes, specifically those with 10,000-20,000 digits. Users suggest utilizing existing libraries like GMP and PARI, which contain algorithms such as the Miller-Rabin test, but note that custom coding is necessary to implement these checks. The original poster seeks pre-written code along with guidance on how to execute it, as they are not proficient in computing. There is a consensus that sharing existing code and instructions would be beneficial for those looking to perform these checks effectively. Overall, the conversation highlights the need for accessible resources and support in computational number theory.
mesa
Gold Member
Messages
694
Reaction score
36
I love pen and paper but am terrible with computing. I have a copy of MatLab on my computer and aside from the operating system and Word that's about it. I need software that can run primality checks on 'small' gigantic primes of 10,000-20,000 digits in length.

Where do I need to start?
 
Technology news on Phys.org
You probably mean that you want something already written that can do a primality check on large numbers.

A lot of software like gmp and pari have code, like the Miller-Rabin test, to do this, but you have to write pieces of your own code to actually do the check itself. There are posters here who have undoubtedly already done this.

I do not have anything like that myself.

So what I perceive that you want is to get a copy of someone's code with instructions on how to build and run it.
I'm pointing this out so that maybe someone will come forward for you.
 
jim mcnamara said:
You probably mean that you want something already written that can do a primality check on large numbers.

A lot of software like gmp and pari have code, like the Miller-Rabin test, to do this, but you have to write pieces of your own code to actually do the check itself. There are posters here who have undoubtedly already done this.

I do not have anything like that myself.

So what I perceive that you want is to get a copy of someone's code with instructions on how to build and run it.
I'm pointing this out so that maybe someone will come forward for you.

Your post is correct although I do have some help on this end. I really need to learn more about these things but need a starting point and the isprime feature on MatLab is not quite cutting it.
 
Thread 'Is this public key encryption?'
I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.
Back
Top