Search the web
Sign In
New User? Sign Up
indocrypt · INDIAN cryptographers society
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Message search is now enhanced, find messages faster. Take it for a spin.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
Messages 30 - 59 of 209   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
30
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...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 5, 2005
2:20 pm
31
http://mathworld.wolfram.com/news/2005-11-08/rsa-640/ __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 9, 2005
3:25 pm
32
A very brief quick introduction to cryptography....
SUDARSHAN IYENGAR
sudarshansr
Offline Send Email
Nov 12, 2005
4:28 am
33
Why people r so interseted in this rsa challenge nos?.What is the use? ... http://mathworld.wolfram.com/news/2005-11-08/rsa-640/ ...
aravind raja
psaravind2004
Offline Send Email
Nov 21, 2005
10:12 am
34
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 ...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 21, 2005
4:35 pm
35
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...
SUDARSHAN IYENGAR
sudarshansr
Offline Send Email
Nov 21, 2005
4:41 pm
36
Can somebody send algorithms ( simplest ) for factorisation ? Just for a start and to get a feeling of the complexity involved? Links or related resources...
ajan u nair
aunair
Offline Send Email
Nov 22, 2005
6:10 am
37
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 ;...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 22, 2005
2:40 pm
38
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...
SUDARSHAN IYENGAR
sudarshansr
Offline Send Email
Nov 23, 2005
1:23 am
39
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...
aravind raja
psaravind2004
Offline Send Email
Nov 23, 2005
10:01 am
40
Do post your factoring algorithm when you are done with it! Sarad. ... __________________________________ Yahoo! FareChase: Search multiple travel sites in one...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 23, 2005
2:53 pm
41
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 ...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 23, 2005
2:54 pm
42
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. ...
SUDARSHAN IYENGAR
sudarshansr
Offline Send Email
Nov 23, 2005
3:42 pm
43
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 ...
aravind raja
psaravind2004
Offline Send Email
Nov 24, 2005
11:43 am
44
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...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 26, 2005
12:58 pm
45
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...
Virendra Sule
virensule
Offline Send Email
Nov 26, 2005
12:58 pm
46
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...
virensule
Offline Send Email
Nov 26, 2005
12:59 pm
47
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...
aravind raja
psaravind2004
Offline Send Email
Nov 26, 2005
1:00 pm
48
hi, I am wondering,there are effecient deterministic factoring algorithms for univariate polynomials with co-efficents from Fp,p a prime.One such ...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 26, 2005
1:00 pm
49
... 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....
Dave Howe
daverhowe
Offline Send Email
Nov 28, 2005
9:55 am
50
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...
aravind raja
psaravind2004
Offline Send Email
Nov 28, 2005
9:55 am
51
Dear All, I am working in Scalar Multiplication algorithm - Elliptic Curve Cryptography. Is there any software / source codes for simulating these algorithms,...
E.Karthikeyan
e_karthi
Offline Send Email
Nov 28, 2005
9:55 am
52
hi, Have a look at the PARI library for elliptic curve routines. ... What kind of congruences? Sarad. __________________________________ Start your day with...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Nov 28, 2005
4:01 pm
53
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...
Virendra Sule
virensule
Offline Send Email
Dec 1, 2005
9:16 am
54
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 ...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Dec 1, 2005
9:17 am
55
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...
ashta lakshmi
ashtalaxmi
Offline Send Email
Dec 9, 2005
5:03 am
56
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...
murtaza masalawala
honestly_urs...
Offline Send Email
Dec 9, 2005
8:15 am
57
hi, Pls see the certicom tutorials in the url below http://www.certicom.com/index.php?action=ecc_tutorial,home Sarad....
Sarad AV
jtrjtrjtr2001
Offline Send Email
Dec 11, 2005
3:33 am
58
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...
Sarad AV
jtrjtrjtr2001
Offline Send Email
Dec 11, 2005
3:35 am
59
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...
Virendra Sule
virensule
Offline Send Email
Jan 1, 2006
3:58 pm
Messages 30 - 59 of 209   Oldest  |  < Older  |  Newer >  |  Newest
Advanced
Add to My Yahoo!      XML What's This?

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help