Dear all:
A revised document has been posted at
http://www.connotech.com/doc_rw_sign_basic-02.html, including a fix for
an elementary security issue (and two other items, see document revision
history).
I received some, but not much, feedback (positive) on the first version.
Regards,
- Th
Paul Hoffman writes:
> The longer that MD5 goes without any hint of preimage attacks, the
> less "certain" I am that collision attacks are even related to
> preimage attacks.
I believe that yesterday, at the rump session at Crypto, restricted
preimage attacks were described. Not quite what you w
At 2:46 PM -0700 8/19/09, Greg Rose wrote:
...some summaries of some of the presentations...
More like this, please! The rump sessions have a lot of value (beyond the
often-strained attempts at humor).
--Paul Hoffman, Director
--VPN Consortium
---
At 5:28 PM -0400 8/19/09, Perry E. Metzger wrote:
>I believe attacks on Git's use of SHA-1 would require second pre-image
>attacks, and I don't think anyone has demonstrated such a thing for
>SHA-1 at this point. None the less, I agree that it would be better if
>Git eventually used better hash fun
Target collisions for MD5 can be calculated in seconds on a laptop,
based on just a small change in the first block of input. There was
also a semi-successful demo of MD5 certificate problems; you could
join the special wireless network, and any https connection would be
silently proxied us
"James A. Donald" writes:
> Getting back towards topic, the hash function employed by Git is
> showing signs of bitrot, which, given people's desire to introduce
> malware backdoors and legal backdoors into Linux, could well become a
> problem in the very near future.
I believe attacks on Git's
[*] Linus Torvalds got the idea of a Cryptographic Hash Function
Directed Acyclic Graph structure from an earlier distributed
revision control tool named Monotone.
OT trivia: The idea actually predates either monotone or git;
opencm (http://opencm.org/docs.html) was using a similiar technique
Watching the rump session online briefly last night, I saw that some
interesting new results on MD5 and AES seem to have been discussed at
the conference. Would anyone care to give us a brief overview for the
mailing list?
Perry
--
Perry E. Metzgerpe...@piermont.com
-
Zooko Wilcox-O'Hearn writes:
> On Wednesday,2009-08-19, at 10:05 , Jack Lloyd wrote:
>
>> On Wed, Aug 19, 2009 at 09:28:45AM -0600, Zooko Wilcox-O'Hearn wrote:
>>
>>> [*] Linus Torvalds got the idea of a Cryptographic Hash Function
>>> Directed Acyclic Graph structure from an earlier distributed
On Wednesday,2009-08-19, at 10:05 , Jack Lloyd wrote:
On Wed, Aug 19, 2009 at 09:28:45AM -0600, Zooko Wilcox-O'Hearn wrote:
[*] Linus Torvalds got the idea of a Cryptographic Hash Function
Directed Acyclic Graph structure from an earlier distributed
revision control tool named Monotone.
O
On Wed, Aug 19, 2009 at 09:28:45AM -0600, Zooko Wilcox-O'Hearn wrote:
> [*] Linus Torvalds got the idea of a Cryptographic Hash Function
> Directed Acyclic Graph structure from an earlier distributed revision
> control tool named Monotone. He didn't go out of his way to give
> credit to Monotone,
Okay, in today's installment I'll reply to my friend Kris Nuttycombe,
who read yesterday's installment and then asked how the storage
service provider could provide access to the files without being able
to see their filehandles and thus decrypt them.
I replied that the handle could be stor
12 matches
Mail list logo