I've always suspected there's an application of the blind source separation problem to discovering the plaintext for a known ciphertext and a characterized keystream. This would be more general Bayesian inference over a number of samples having the same plaintext (a crib) but different keystreams potentially with a complex function applied. I've used a simple version in my own cryptanalysis.