This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
this is my rough code for Rabin Miller....(without next probable and witness)
i wrote this code..with help of William Stallings..for network security..and cryptography
i wanaa to write it..myself..
guyz..i have tested many times the code..but it didnt give Prime Number
is there any problem with the code.....then please..point out...it's very very important for me.....or suggest me to generate prime no. using other ways..
Welcome to the Ranch
You didn’t use the code button correctly, but I have sorted that out. I also got rid of lots of unnecessary tags and excess whitespace, which makes the code more difficult to read.
Wny have you got comments like // BigInt for n, rather than simply calling the variable n? You also have too many imports. Isn’t there a BigInteger.ONE object ready for you to use?
You cannot work out the algorithm by reading the code. You need to write the algorithm on paper, and then carefully translate that to code. Have you done that? That is probably the only way you can sort out the problem.
I’ve looked at a lot of different solutions, and in my humble opinion Aspose is the way to go. Here’s the link: http://aspose.com