@aayush Dude... i dont knw from where did u find such a stupid question... Whole cryptography.........mean all SSL , RSA , etc etc based on large numbers which have prime factors... if we are able to break them in partitions then whole security is..................... !!!!!!!!!!!!! Cryptography's base is wholly and wholly depends on large numbers with large prime factors....
On Thu, Sep 8, 2011 at 11:25 AM, siddharam suresh <[email protected]>wrote: > guys there is subject called number theory and cryptography, in which > there are so many algos to find prime number and prime factors of the > number. > > Thank you, > Sid. > > > > On Thu, Sep 8, 2011 at 11:17 AM, bharatkumar bagana > <[email protected]> wrote: > > @sukran : > > sieve of erathothenes algo gives only the prime numbers below a number .. > > How can we find a number's all prime factors using this algo ....pls > explain > > ... > > > > On Wed, Sep 7, 2011 at 5:15 PM, sukran dhawan <[email protected]> > > wrote: > >> > >> sieve of erathothenes algo > >> > >> On Wed, Sep 7, 2011 at 1:36 PM, Yogesh Yadav <[email protected]> wrote: > >>> > >>> prime no has only 2 factors. number itself and 1. > >>> > >>> > >>> > >>> On Wed, Sep 7, 2011 at 12:14 PM, aayush jain <[email protected]> > wrote: > >>>> > >>>> can anybody tell me the code of find the prime no. and after finding > >>>> prime no. find its prime factore using linkes list?????? -- > >>>> You received this message because you are subscribed to the Google > >>>> Groups "Algorithm Geeks" group. > >>>> To post to this group, send email to [email protected]. > >>>> To unsubscribe from this group, send email to > >>>> [email protected]. > >>>> For more options, visit this group at > >>>> http://groups.google.com/group/algogeeks?hl=en. > >>> > >>> -- > >>> You received this message because you are subscribed to the Google > Groups > >>> "Algorithm Geeks" group. > >>> To post to this group, send email to [email protected]. > >>> To unsubscribe from this group, send email to > >>> [email protected]. > >>> For more options, visit this group at > >>> http://groups.google.com/group/algogeeks?hl=en. > >> > >> -- > >> You received this message because you are subscribed to the Google > Groups > >> "Algorithm Geeks" group. > >> To post to this group, send email to [email protected]. > >> To unsubscribe from this group, send email to > >> [email protected]. > >> For more options, visit this group at > >> http://groups.google.com/group/algogeeks?hl=en. > > > > > > > > -- > > > > Please do not print this e-mail until urgent requirement. Go Green!! > > Save Papers <=> Save Trees > > BharatKumar Bagana > > http://www.google.com/profiles/bagana.bharatkumar > > Mobile +91 8056127652 > > > > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > For more options, visit this group at > > http://groups.google.com/group/algogeeks?hl=en. > > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- **Regards SAGAR PAREEK COMPUTER SCIENCE AND ENGINEERING NIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
