February 15th, 2012, 11:38 AM  #1 
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  About cryptography
Read here http://arstechnica.com/business/news/20 ... curity.ars Maybe maybe maybe Mister Greathouse remember what I told him long time ago. He rebuked my assertion without even trying to check. I will find the post. Good reading! 
February 16th, 2012, 07:01 AM  #2 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: About cryptography
I'm not sure what you're talking about, in particular, but thanks for the article.

February 16th, 2012, 09:51 AM  #3  
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  Re: About cryptography Quote:
I do not know how to give the exact post but try in search ' Transparent semiprimes" then you will find all my thoughts at that time. Good reading. Two things you have to keep in mind : 1. All the keys to encrypt are PUBLIC that means that you could build a database of those numbers (a billion or more semiprime numbers to factorize). 2. Every day I discover a new idea to add anoher algo to my "batterie" (in french I do not know how to translate it in english) of tests. If each algo require 1 second to test any number and it allllows to factorize thousanda of numbers imagine what I can do with a hundreds. I have calculated that 1 out 422 is solved for less than 100.000.000 using only one algo. I'm sure that there is some very complex link between some values (and/or digits) that we can extract from any number and its factors. So if I can factor one out of even 1.000.000 I can still hope to find the factors of the billion or more public numbers. RSA works if you have only a few numbers known by the public but when you have billions known it will not work.  
February 16th, 2012, 09:54 AM  #4 
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  Re: About cryptography
Here is the core of my idea. It is a quote of my post RSA works if you have only a few numbers known by the public but when you have billions known it will not work. Today I can say that I was right! 
February 16th, 2012, 09:57 AM  #5 
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  Re: About cryptography
Here is the more important post viewtopic.php?f=40&t=2376&p=9681&hilit=transparent +semi+primes#p9681 There are others where I defended the same idea. 
February 16th, 2012, 10:06 AM  #6  
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: About cryptography Quote:
 
February 16th, 2012, 10:26 AM  #7  
Senior Member Joined: Jan 2011 Posts: 560 Thanks: 1  Re: About cryptography Quote:
Keep in mind that those guy who have discovered the flaw I discovered more than 4 years ago have a large team of programmers very powerful computers money and so on. I have an old computer. I'm not programmer. I use only Excel to check my ideas. More than that it seems to me that you have short memory. I can give other posts it is going to take me time. Going through 100"s of posts to find other arguments it is really hard even with the help of search program.  
February 16th, 2012, 03:26 PM  #8 
Global Moderator Joined: Nov 2006 From: UTC 5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms  Re: About cryptography
At no point did you present an algorithm that could factor an arbitrary semiprime faster than existing methods.


Tags 
cryptography 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
cryptography  prodo  Computer Science  11  January 13th, 2008 02:40 AM 