SYNOPSIS
#include <shishi.h>int shishi_n_fold(Shishi * handle, const char * in, size_t inlen, char * out, size_t outlen);
ARGUMENTS
- Shishi * handle
- shishi handle as allocated by shishi_init().
- const char * in
- input array with data to decrypt.
- size_t inlen
- size of input array with data to decrypt ("M").
- char * out
- output array with decrypted data.
- size_t outlen
- size of output array ("N").
DESCRIPTION
Fold data into a fixed length output array, with the intent to give each input bit approximately equal weight in determining the value of each output bit.The algorithm is from "A Better Key Schedule For DES-like Ciphers" by Uri Blumenthal and Steven M. Bellovin, http://www.research.att.com/~smb/papers/ides.pdf, although the sample vectors provided by the paper are incorrect.
RETURN VALUE
Returns SHISHI_OK iff successful.REPORTING BUGS
Report bugs to <[email protected]>.COPYRIGHT
Copyright © 2002-2010 Simon Josefsson.Copying and distribution of this file, with or without modification, are permitted in any medium without royalty provided the copyright notice and this notice are preserved.