b-m.c is an implementation of the Berlekamp-Massey algorithm for analysing
Linear Feedback Shift Registers. See the code itself for how to use it.
It reports various cryptographically interesting things like unexpected
jumps in linear complexity. Heiko Mahr made a more commented C++ version.

The homepage for this implementation of Berlekamp-Massey is located at:

	http://www.qualcomm.com.au/UsefulStuff.html