No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
|
hey i am trying to write a program to find x and y for equations of the form : y^2 mod p = (x^3+ax+b)mod p y--> unknown. range from 0 to p-1. x-->unknown. range from 0 to p-1. p--> a large prime number. i am currently using plain brute force … |
|
|
hi eveyone out there!!!!!! am a student intending on developin a software for cryptography.... i have read a couple of books on this subject, but it has given me very little ideas to proceed any further, so if any one of u can help me out with it, it would … 
|
|
|
hey i am trying to implement the diffie hellman key exchange algorithm in matlab. my problem is this: the program works just fine for numbers upto 5 digits, but after that it just sort of stops working. thing is i need to deal (multiply,exponentiation,modular arith etc.) with really big numbers … |