http://www.techworld.com/storage/news/index.cfm?NewsID=4727&inkc=0 "Another factor is encryption sophistication. If 256-bit triple-DES or similar techniques...
http://mathworld.wolfram.com/news/2005-11-08/rsa-640/ __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the...
hi, Since integer factoring is a 'hard' problem, the security of the RSA encryption algorithm revolves around it.The breaking of each challenge gives an idea ...
Its just the curiosity. Also is the reason that no efficient method is known to factor except for intelligent brute forcing kinda technique. Factoring problem...
Can somebody send algorithms ( simplest ) for factorisation ? Just for a start and to get a feeling of the complexity involved? Links or related resources...
hi, The easiest algorithm to code up will be trial division.Let 'n' be the number you want to factor.Generate primenumbers P_i=2,3,5... Max=sqrt(n) for(P_i=2 ;...
you are computing just the prime factors of the number n. To factorize a number you also need to know the highest power of the prime which is the factor of the...
hai I ask this question just for fun.I am doing my M.S thesis on factoring algorithms.Now I am working on designing a new factoring algorithm. In the case of...
Do post your factoring algorithm when you are done with it! Sarad. ... __________________________________ Yahoo! FareChase: Search multiple travel sites in one...
hi, The algorithm calculates all the prime powers of 'n',it gives the complete factorisation. It has a 'while loop',the same context as in a C program. It ...
I get you, this seems to be a linear time problem to generate the exact factorization once the complete set of primes which divide the number are known. ...
Hai I am still not yet designing a better algorithm then Number field sieve.(its really a huge task).I have some new innovative ideas(like intelligent brute ...
To find the prime power we will have to divide 'n' by the prime repeatedly.Since trivial division is usually done in O(n^2),it probably should be called...
Dear All Sorry, my question is not strictly about material in Koblitz's book but might be of interest to members on this group. Q. What algorithms are...
Dear All Sorry to have sent the msg again. I think the earlier one did not get through. Q. What are the well known algorithms for sum of squares representation...
The paper name is "A Tale of two Sieves" by Carl Pomerance.Can get easily by google search. ... Hai I am still not yet designing a better algorithm then Number...
... Should be possible to do this a bit smarter, by realising that the power can be represented by the product of powers whose value is itself a power of two....
What do u mean by sum of squares representation? ie (a^2) - (b^2) = n. Where n = no to be factored. ... Dear All Sorry to have sent the msg again. I think the...
Dear All, I am working in Scalar Multiplication algorithm - Elliptic Curve Cryptography. Is there any software / source codes for simulating these algorithms,...
hi, Have a look at the PARI library for elliptic curve routines. ... What kind of congruences? Sarad. __________________________________ Start your day with...
Thanks for your querry. I actually meant writing the positive integer n as n=\sum a_{i}^{2} with finite number of terms. But I think this may generalize to...
hi, Let == indicate congruent to. let !== indicate incongruent to. Algorithms such as quadratic seive finds two integers x and y,such that x^2==y^2(mod n) and ...
hai i think there is book for implenting elliptic curves i think book name is implementing elliptic curve by rosing i think its correct i will confirm and let...
Hello frenz Many of us might not have much insight into what is elliptic curve cryptography. I have read a little on the same but the concept is not so clear...
hi, Thats right, you can find more info on this book at the url below. http://www.manning.com/books/rosing Nice book for coding up ECC applications in C. The...
Dear Indocrypt members Given two elements a, b in a finite field K, what is the criterion for deciding whether there exists r such that b=a^r? Can this be done...