Outdated egg!

This is an egg for CHICKEN 4, the unsupported old release. You're almost certainly looking for the CHICKEN 5 version of this egg, if it exists.

If it does not exist, there may be equivalent functionality provided by another egg; have a look at the egg index. Otherwise, please consider porting this egg to the current version of CHICKEN.

md5
  1. Outdated egg!
  2. md5
  3. Documentation
    1. Digest Procedures
      1. md5-primitive
  4. Usage
  5. Examples
  6. Requirements
  7. Notes
  8. Author
  9. Version history
  10. License

Documentation

Computes MD5 checksums

Digest Procedures

Any Scheme-object can be the SOURCE for a digest. See message-digest for more information.

md5-primitive

[procedure] (md5-primitive)

Returns the 128-bit checksum primitive object.

Usage

 
(require-extension md5)

Examples

 
(use md5 message-digest)

(message-digest-string (md5-primitive) "abc")
 ;=> "900150983cd24fb0d6963f7d28e17f72"

Requirements

message-digest

Notes

Author

Colin Plumb, wrapped for Chicken by Peter Bex

Version history
3.2.0
Add raw-update. Kon Lovett
3.1.0
Add block-length. Kon Lovett
3.0.0
Remove deprecated procedures. Kon Lovett
2.5
Make function declarations static in order to avoid conflicts with those from libc if the OS supplies them. This makes MD5 work on OpenBSD (thanks to Alan Post and Christian Kellermann)
2.4
Change deprecated pointer foreign type specifier to scheme-pointer to make it work under chickens newer than 4.6.0.
2.3
Do not define uint32 as uint32_t but use it directly to avoid conflicts with system-defined types on some OSes.
2.2
a message-digest-primitive has no "state". Kon Lovett
2.1
Fixed typo in setup file that caused the extension to get installed under the name "m5"
2.0
Chicken 4 implementation. Replaced GPL code with common public domain code.
1.1
Added dependency on message-digest egg
1.0
Initial release

License

 
This code implements the MD5 message-digest algorithm.
The algorithm is due to Ron Rivest.  This code was
written by Colin Plumb in 1993, no copyright is claimed.
This code is in the public domain; do with it what you wish.
Equivalent code is available from RSA Data Security, Inc.
This code has been tested against that, and is equivalent,
except that you don't need to include two pages of legalese
with every copy.