3 ms·
As a (related) example, consider the SHA family of hashing algorithms. Competitions are held in which anyone can submit their own algorithm as a possible conte
by jlgaddis 13y ago
As a (related) example, consider the SHA family of hashing algorithms.
Competitions are held in which anyone can submit their own algorithm as a possible contender. Like a beauty pageant, the entries are narrowed down over a few rounds until just a few are left. Eventually, one algorithm is chosen and declared the winner!
The whole process is done in the open and, similar to RFCs, anyone who wishes to may provide feedback.
The SHA-3 competition took roughly five years. You can read about the whole process on the NIST's web site:
http://csrc.nist.gov/groups/ST/hash/sha-3/index.html
I'm not a developer or math whiz so most of the underlying principles of crypto are over my head but read about the process (above) is quite interesting and gave me a much better understanding in general.