Ek Phnom, near Battambang, Hashed Speed cameras
Ek Phnom seems to be a hangout for local teens rather than tourists
Hash codes weak, Speed cameras thrown out of Court
SAN FRANCISCO, Aug. 16 - Last year a Chinese mathematician, Xiaoyun Wang,..exposing a new vulnerability in a crucial American standard for data encryption. On Monday, she was scheduled to explain her discovery in a keynote address to an international group of researchers meeting in California.
Ms. Wang, a mathematician at Tsinghua University in Beijing, and her student Hongbo Yu were scheduled to present a paper in Santa Barbara on Monday on their successful attack on a United States government cryptographic function called Sha-1.
But a stand-in had to take her place, because she was not able to enter the country. Indeed, only one of nine Chinese researchers who sought to enter the country for the conference received a visa in time to attend.
..annual meeting of the International Cryptology Conference..
..Stuart Haber, a Hewlett-Packard computer security expert who is program chairman for t , Crypto 2005, being held this week in Santa Barbara. "We need to learn from them, but we are shooting ourselves in the foot."
And in Aus:
Speed Camera fines have been thrown out because the hash algorithm (MD5?) is weak ???
Designed in the early 1990s by an American academic, MD5 safeguards against tampering by turning information into a 128-bit sequence of digits. However, researchers from China's Shandong University have proved it is possible to store conflicting pieces of information as the same MD5 sequence.
Nick Ellsmore, an encryption expert at the consultancy SIFT, said this theoretically meant the RTA could change the speed at which a car was recorded and retain the same code.
It seems that Both MD5 & SHA-1 have weakness...
James Randall, RSA Laboratories March 11, 2005
The news of vulnerabilities in the SHA-1 algorithm emerged at a panel discussion at RSA Conference 2005 in San Francisco. An abstract from the research team of Xiaoyun Wang, Yiqun Lisa Yin and Hongbo Yu described how two separate messages could be found that deliver the same SHA-1 hash using 2^69 operations, far fewer than the 2^80 operations previously thought needed to find a "collision" with an SHA-1 hash. This is basically the same kind of breakthrough as with the MD5 result last summer that required only 2^40 operations to find a collision.
As an expert, I maintain that the "weakness" would be theoretical, ie it would be vastly unlikely that the RTA could change the kph and retain the same hash. Although 2^40 operations aint many, something like a wet afternoon on a decent PC.
So my expert opinion is that RTA photographs could not be altered on a practical basis, and convictions based on speed cameras should stand.
From: Geoffrey Leeming >email@example.com< href="http://www.mckeay.net.hyperlink.cz/MD5_collisions.html">www.mckeay.net eprint.iacr... cryptography@metzdowd
also: who is
"Luc The Perverse" a*SPAM*t_AND_a-DIEfirstname.lastname@example.org
"Luc The Perverse" sll_noSpamlicious_z_XXX_m@cc.usu.edu
...any relation to P Smith of Herne Bay who infamously patented the LUC algorithm?
Farewell Spit from NASA