Alessandro Budroni, Andrea Tenti. The Mersenne Low Hamming Combination Search Problem Can Be Reduced to an ILP Problem. In Johannes Buchmann 0001, Abderrahmane Nitaj, Tajje-eddine Rachidi, editors, Progress in Cryptology - AFRICACRYPT 2019 - 11th International Conference on Cryptology in Africa, Rabat, Morocco, July 9-11, 2019, Proceedings. Volume 11627 of Lecture Notes in Computer Science, pages 41-55, Springer, 2019. [doi]
@inproceedings{BudroniT19-0,
title = {The Mersenne Low Hamming Combination Search Problem Can Be Reduced to an ILP Problem},
author = {Alessandro Budroni and Andrea Tenti},
year = {2019},
doi = {10.1007/978-3-030-23696-0_3},
url = {https://doi.org/10.1007/978-3-030-23696-0_3},
researchr = {https://researchr.org/publication/BudroniT19-0},
cites = {0},
citedby = {0},
pages = {41-55},
booktitle = {Progress in Cryptology - AFRICACRYPT 2019 - 11th International Conference on Cryptology in Africa, Rabat, Morocco, July 9-11, 2019, Proceedings},
editor = {Johannes Buchmann 0001 and Abderrahmane Nitaj and Tajje-eddine Rachidi},
volume = {11627},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-23696-0},
}