Slashdot Mirror
Cryptol, Language of Cryptography, Now Available To the Public
solweil writes to mention that Cryptol, a 'domain specific language for the design, implementation and verification of cryptographic algorithms,' is now available to the public. Cryptol was originally designed for the NSA. It allows for a quick evaluation and continued revisions, and is available for Linux, OS X, and Windows.
41R5T 3N6RI27ED P057 !
So, wait, the NSA just released math?
Sounds more like a drug than a programming language.
Do you even lift?
These aren't the 'roids you're looking for.
So, how DO you factor large semiprimes fast?
That "M+" button on your calculator that no-one knows how to use. That's what it does.
At last, we now have a programming language that implements rot13() natively! Now my website's login authentication system will really fly...
Use Cryptol + AJAX!
Why would they release this? Don't get me wrong, I, personally, am all for donating to the community and further advancing technology as a species; however, why would the NSA deliver something to the public that would, in the long run, possibly make life harder on themselves by possibly furthering the advances of private encryption? I'm not trying to play Devil's Advocate, I just genuinely don't understand why they would (possibly) make life harder for themselves.
Yes, why? This is as dangerous as releasing a dictionary - possibly allowing wildly speculative internet postings with less spelling mistakes.
Down with that sort of thing! Careful Now.
- Father ted.
So, how DO you factor large semiprimes fast?
can someone explain why this is hard to do? It seems like a straghtforward process since the number of primes is essentially fixed. (there are quite a few of them but we keep hearing announcements about a new ONE being found, so there can't be that many of them that are known, someone's got a book I'm sure)
Just a matter of looping through all known primes, seeing if x divides by it. That's order 1 since the number of primes is "fixed". If you don't find anything it divides by, it's a new prime (add it to your list) or its smallest factor is larger than your biggest known prime. Otherwise remember that factor, and start working on the dividend.
Why is this always considered such a hard thing to do? It looks like something that should go quick.
Heck with modern day processors I'd imagine you could fab a specialized chip that determines which of the "known primes" the provided number has as one of its divisors as a one-step (parallel) operation. Just hardcode it to those primes.
I work for the Department of Redundancy Department.
I use that to store "5318008" in memory so I always have one on hand.
... postings with fewer spelling mistakes.
Moral: Practice what you preach.
I have never worked at the agency, but I was once in an orgy with Bob, Eve, and Alice.
Fascism trolls keeping me up every night. When I starts a preachin', he HITS ME WITH HIS REICH!
Is there anything that little button can't do? I have a feeling "M+" stands for "More magic".
There are infinitely many prime numbers.
The GP said the number of primes is essentially fixed which is consistent with the number of primes being infinite, I suppose.
http://michaelsmith.id.au