A public forum for discussing the design of software, from the user interface to the code architecture. Now closed.
what are digest algorithms?especially,what digest means in this context?
Friday, May 18, 2007
Just coincidentally, I ran across this today:
Very simple: one-way functions. A leads to B, but it's impossible to derive A from B.
For example, A = 13, and the digest algorithm is % 5. B would then be 3, but it's impossible to find out whether A was 3, 8, 13, 18, etc, only from entering B and knowing the digest function.
(Note that this is a very very VERY basic example).
Sunday, May 20, 2007
They are one-way hash functions. Good digest algorithms result in very few if any collisions.
Mark Van Ditta
Tuesday, May 22, 2007
This topic is archived. No further replies will be accepted.Other recent topics
Powered by FogBugz