The following papers would be useful for checking whether known random-subset-sum algorithms can instantiate the efficient anchored binary Ring-ISIS compiler. I could locate bibliographic pages but not an openly accessible copy of the article itself.
- Russell Impagliazzo and Moni Naor, Efficient Cryptographic Schemes Provably as Secure as
Subset Sum, Journal of Cryptology 9(4), 1996, pp. 199–216,
DOI 10.1007/BF00189260.
- ../refs/BF00189260.pdf
- Chris Monico, Cryptanalysis of a Hash Function, and the Modular Subset Sum Problem, Groups, Complexity, Cryptology 11(1), 2019, pp. 17–23, DOI 10.1515/gcc-2019-2001.