I am to program the Solovay-Strassen primality test presented in the original paper on RSA. Additionally I will need to write a small bignum library, an开发者_开发技巧d so when searching for a conven
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
Given A, on the order of 10^20, I\'d like to quickly obtain a list of the first few prime numbers greater than A. OK, my needs aren\'t quite that exact - it\'s alright if occasionally a composite numb
I\'m trying to generate prime numbers based on user input. This is what I have so far but I just can\'t seem to figure it out:
i am开发者_开发问答 simulating my crypto scheme in python, i am a new user to it. p = 512 bit number and i need to calculate largest prime factor for it, i am looking for two things:
I am trying to make a program that determines if the number is prime or composite. I have gotten thus far. Could you give me any ideas so that it will work? All primes will , however, because composit
I am trying to find the fastest way to check whether a given number is prime or not (in Java). Below are several primality testing methods I came up with. Is there any better way than the second imple
I have been attempting to write a program that will determine if a number is prime or not. I have based it off of the Sieve of Eratosthenes. Anyway, my program works for small numbers (15485863 works)
I am new to Scheme. I have tried and implemented probabilistic variant of Rabin-Miller algorithm using PLT Scheme. I know it is probabilistic and all, but I am getting the wrong results most of the ti
Recently I\'ve been working on a C++ prime generator that uses the Sieve of Atkin ( http://en.wikipedia.org/wiki/Sieve_of_atkin ) to generate its primes.My objective is to be able to generate any 32-b