Security of SWIFFT Hash Function Is the SWIFFT hash function described in:

https://en.wikipedia.org/wiki/SWIFFT

still considered a provably secure one way function?  Is it also considered secure against attacks by a quantum computer?  Would it be a good candidate for a post-quantum (quantum safe) hash?
You have to be a bit careful here, I think. 

The SWIFFT hash function is linear and does not behave like a random oracle. It is second pre-image resistant in an asymptotic sense. The fact that this property seems to depend on "a relatively mild assumption about the worst-case difficulty of finding short vectors in cyclic/ideal lattices" would seem to suggest (subject to verification) it might be post quantum secure (like NTRU which is also based on cyclic/ideal lattices).

However, the SWIFFT function is defined for fixed input length. Hence it cannot be directly used as a one way hash function for arbitrary length inputs, maybe it could be a building block for a post quantum secure one way hash function, I am not sure.