Is there a Matlab implementation of SIMD-oriented Fast Mersenne Twister (SFMT)?

Hi,

I'm working on a specific application of the Fiyat-Shamir heuristic in Matlab, for which I can use a rng function that takes as input a seed of arbitrary length (instead of only 32-bit integers, like Matlab's implementation). Is there any available implementation that I can use?

Thanks,

-Matan

[Jan]

I'm looking in the C-sources today. Perhaps it is easy to wrap this in a MEX function.