Files
2026-02-12 14:30:34 +01:00

157 lines
5.6 KiB
BibTeX

@inproceedings{blackhat_2014,
author = "Sebastien Andrivet",
title = "C++11 metaprogramming applied to software obfuscation - Black Hat Europe 2014",
year = "2014",
howpublished = {\url{https://blackhat.com/docs/eu-14/materials/eu-14-Andrivet-C-plus-plus11-Metaprogramming-Applied-To-software-Obfuscation-wp.pdf}},
}
@misc{parata,
author = "Antonio Parata",
title = "Deobfuscating C++ ADVobfuscator with Sojobo and the B2R2 binary analysis framework",
year = "2020",
howpublished = {\url{https://antonioparata.blogspot.com/2020/06/deobfuscating-c-advobfuscator-with.html}},
}
@misc{floss,
author = "Mandiant",
title = "FLOSS Version 2.0",
year = "2022",
howpublished = {\url{https://cloud.google.com/blog/topics/threat-intelligence/floss-version-2/}},
}
@misc{pikabot,
author = "Nikolaos Pantazopoulos",
title = "Automating Pikabot's String Deobfuscation",
year = "2024",
howpublished = {\url{https://www.zscaler.com/blogs/security-research/automating-pikabot-s-string-deobfuscation}},
}
@misc{trickbot,
author = "Kevin Henson",
title = "TrickBot gang uses template-based metaprogramming in Bazar malware",
year = "2022",
howpublished = {\url{https://www.ibm.com/think/x-force/trickbot-gang-template-based-metaprogramming-bazar-malware}},
}
@misc{obfuscation_software,
author = "Wikipedia",
title = "{Obfuscation (software)} --- {W}ikipedia{,} The Free Encyclopedia",
year = "2026",
howpublished = {\url{http://en.wikipedia.org/w/index.php?title=Obfuscation\%20(software)&oldid=1336408601}},
note = "[Online; accessed 12-February-2026]"
}
@misc{cpp20,
author = "ISO",
title = "{C++20} --- {ISO/IEC} 14882:2020",
year = "2020",
howpublished = {\url{https://isocpp.org/files/papers/N4860.pdf}},
}
@article{barak_impossibility_2012,
title = {On the (im)possibility of obfuscating programs},
volume = {59},
issn = {0004-5411, 1557-735X},
url = {https://dl.acm.org/doi/10.1145/2160158.2160159},
doi = {10.1145/2160158.2160159},
language = {en},
number = {2},
urldate = {2026-02-11},
journal = {Journal of the ACM},
author = {Barak, Boaz and Goldreich, Oded and Impagliazzo, Russell and Rudich, Steven and Sahai, Amit and Vadhan, Salil and Yang, Ke},
month = apr,
year = {2012},
pages = {1--48},
}
@phdthesis{jean_cappaert_2012,
author = {Jan Cappaert},
school = {Katholieke Universiteit Leuven},
title = {Code Obfuscation Techniques for Software Protection},
year = {2012},
url = {https://cosicdatabase.esat.kuleuven.be/backend/publications/files/these/199}
}
@inproceedings{madou_effectiveness_2006,
author = {Madou, Matias and Anckaert, Bertrand and Bus, Bruno and De Bosschere, Koen and Cappaert, Jan and Preneel, Bart},
year = {2006},
month = {01},
pages = {527-533},
title = {On the Effectiveness of Source Code Transformations for Binary Obfuscation.}
}
@book{aho_compilers:_2014,
address = {Essex},
edition = {Pearson new international edition, second edition},
series = {Pearson custom library},
title = {Compilers: principles, techniques, and tools},
isbn = {9781292037233},
shorttitle = {Compilers},
language = {eng},
publisher = {Pearson},
author = {Aho, Alfred V. and Lam, Monica S. and Sethi, Ravi and Ullman, Jeffrey D.},
year = {2014},
}
@book{stroustrup_cpp_2015,
address = {Upper Saddle River, NJ},
edition = {4. ed., 4. print},
title = {The {C}++ programming language: {C}++ 11},
isbn = {9780321563842},
shorttitle = {The {C}++ programming language},
language = {eng},
publisher = {Addison-Wesley},
author = {Stroustrup, Bjarne},
year = {2015},
}
@misc{static_metaprogramming,
author = {Department of General Computer Science - Eötvös Loránd University},
howpublished = {\url{http://aszt.inf.elte.hu/~gsd/halado_cpp/ch06s04.html#Static-metaprogramming}},
title = {C++ Template Metaprogramming}
}
@article{payne_coding_1969,
title = {Coding the {Lehmer} pseudo-random number generator},
volume = {12},
issn = {0001-0782, 1557-7317},
url = {https://dl.acm.org/doi/10.1145/362848.362860},
doi = {10.1145/362848.362860},
abstract = {An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random number generator modulo 2 ** 31 - 1, a prime Mersenne number which produces 2 ** 31 - 2 numbers, on a
p
-bit (greater than 31) computer. The computation method is extendible to limited problems in modular arithmetic. Prime factorization for 2 ** 61 - 2 and a primitive root for 2 ** 61 - 1, the next largest prime Mersenne number, are given for possible construction of a pseudo-random number generator of increased cycle length.},
language = {en},
number = {2},
urldate = {2026-02-12},
journal = {Communications of the ACM},
author = {Payne, W. H. and Rabung, J. R. and Bogyo, T. P.},
month = feb,
year = {1969},
pages = {85--86},
}
@article{park_random_1988,
title = {Random number generators: good ones are hard to find},
volume = {31},
issn = {0001-0782, 1557-7317},
shorttitle = {Random number generators},
url = {https://dl.acm.org/doi/10.1145/63039.63042},
doi = {10.1145/63039.63042},
abstract = {Practical and theoretical issues are presented concerning the design, implementation, and use of a good, minimal standard random number generator that will port to virtually all systems.},
language = {en},
number = {10},
urldate = {2026-02-12},
journal = {Communications of the ACM},
author = {Park, S. K. and Miller, K. W.},
month = oct,
year = {1988},
pages = {1192--1201},
}
@inproceedings{neves,
author = {Neves, Samuel and Araujo, Filipe},
year = {2012},
month = {09},
title = {Binary code obfuscation through C++ template metaprogramming}
}