He also said the recently announced Boot Camp software, which allows Intel-based Mac computers to run the Windows operating system, won't have a big impact on Adobe's Mac software lineup.
"For the majority of our products, writing directly to the Macintosh operating system is an advantage to the customers, and you will see us continue to do so and not work through Boot Camp or the Windows emulator because we think that will not be good for the majority of our customers," he said.
And this is all relevant because... what? If he doesn't care about the GPL, what does it matter? It actually has nothing to do with this slashdot post at all.
Like Tabs? Check out Proteus. Currently is has some issues with MSN, but there are fixes for those. It has tabbed IM windows and a host of other features.
Proteus: http://www.indigofield.com/
If you can get a hold of a Pentax K1000 they are excellent cameras, great for beginners. Full manual, built in light meter. You don't need anything else. They have rugged metal bodies so they can take a dishing. Almost everyone I know learnt from one.
Re:Mine is 1024 too...
on
RSA-576 Factored
·
· Score: 2, Informative
There is an Index Calculus Algorithm for computing Discrete Logarithms that is analogous to the Quadratic Sieve method for factoring integers. Similarly there are variants that will solve the discrete logarithm problem over the integers modulo n in time comparable to the Number Field Sieve, which is what was used to factor this particular number from RSA.
The only reason we don't hear about ElGamal Keys being broken is that there aren't big rewards for such an accomplishment, and because ElGamal another other Discrete Log based systems are not as widely used in practice.
Certicom does have a contest to compute discrete logarithms over the group found by taking points on an elliptical curve. These problems aren't as popular to solve it seems, in part I imagine because there is no good way to solve the problem when your group is the points on an elliptical curve. (So an interesting result of this is that the keys for discrete log systems over elliptical curves are MUCH smaller,)
The best known means for solving the Discrete Log Problem over an EC is much slower then the best known means for factoring integers. This is why they can claim that a 512 bit ECC key is equivilant to a 15630 bit RSA key. The time it would take to solve both problems is equivilant.
Slashdot Mirror
Because there are no geeks in India. No sir. Only heartless Indians looking to steal all your jobs.
And this is all relevant because ... what? If he doesn't care about the GPL, what does it matter? It actually has nothing to do with this slashdot post at all.
Like Tabs? Check out Proteus. Currently is has some issues with MSN, but there are fixes for those. It has tabbed IM windows and a host of other features. Proteus: http://www.indigofield.com/
If you can get a hold of a Pentax K1000 they are excellent cameras, great for beginners. Full manual, built in light meter. You don't need anything else. They have rugged metal bodies so they can take a dishing. Almost everyone I know learnt from one.
There is an Index Calculus Algorithm for computing Discrete Logarithms that is analogous to the Quadratic Sieve method for factoring integers. Similarly there are variants that will solve the discrete logarithm problem over the integers modulo n in time comparable to the Number Field Sieve, which is what was used to factor this particular number from RSA. The only reason we don't hear about ElGamal Keys being broken is that there aren't big rewards for such an accomplishment, and because ElGamal another other Discrete Log based systems are not as widely used in practice. Certicom does have a contest to compute discrete logarithms over the group found by taking points on an elliptical curve. These problems aren't as popular to solve it seems, in part I imagine because there is no good way to solve the problem when your group is the points on an elliptical curve. (So an interesting result of this is that the keys for discrete log systems over elliptical curves are MUCH smaller,)
The best known means for solving the Discrete Log Problem over an EC is much slower then the best known means for factoring integers. This is why they can claim that a 512 bit ECC key is equivilant to a 15630 bit RSA key. The time it would take to solve both problems is equivilant.