%0 Conference Paper %1 conf/africacrypt/BudroniT19 %A Budroni, Alessandro %A Tenti, Andrea %B AFRICACRYPT %D 2019 %E Buchmann, Johannes %E Nitaj, Abderrahmane %E eddine Rachidi, Tajje %I Springer %K dblp %P 41-55 %T The Mersenne Low Hamming Combination Search Problem Can Be Reduced to an ILP Problem. %U http://dblp.uni-trier.de/db/conf/africacrypt/africacrypt2019.html#BudroniT19 %V 11627 %@ 978-3-030-23696-0

@inproceedings{conf/africacrypt/BudroniT19, added-at = {2019-07-02T00:00:00.000+0200}, author = {Budroni, Alessandro and Tenti, Andrea}, biburl = {https://www.bibsonomy.org/bibtex/22cce207611c9b6bef0f695227e55914f/dblp}, booktitle = {AFRICACRYPT}, crossref = {conf/africacrypt/2019}, editor = {Buchmann, Johannes and Nitaj, Abderrahmane and eddine Rachidi, Tajje}, ee = {https://doi.org/10.1007/978-3-030-23696-0_3}, interhash = {8f5db6b2993ab4a1028b579f1483fea5}, intrahash = {2cce207611c9b6bef0f695227e55914f}, isbn = {978-3-030-23696-0}, keywords = {dblp}, pages = {41-55}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-07-03T11:39:11.000+0200}, title = {The Mersenne Low Hamming Combination Search Problem Can Be Reduced to an ILP Problem.}, url = {http://dblp.uni-trier.de/db/conf/africacrypt/africacrypt2019.html#BudroniT19}, volume = 11627, year = 2019 }