( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Algebraic Fault Attack on SHA Hash Functions Using Programmatic SAT Solvers.

, , , и . CP, том 11008 из Lecture Notes in Computer Science, стр. 737-754. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Mahmoud Nejati

Semiramis Saeed-Akbari

Sajjad Saeed

Abdulla Saeed Hizam

Muhammad Farhan Saeed

 

Другие публикации лиц с тем же именем

Online Bayesian Moment Matching based SAT Solver Heuristics., , , , и . ICML, том 119 из Proceedings of Machine Learning Research, стр. 2710-2719. PMLR, (2020)MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers., , , , и . TACAS (2), том 12652 из Lecture Notes in Computer Science, стр. 303-325. Springer, (2021)Non-Deterministic Timers for Hardware Trojan Activation (or How a Little Randomness Can Go the Wrong Way)., , , и . WOOT, USENIX Association, (2016)A Machine Learning Based Splitting Heuristic for Divide-and-Conquer Solvers., , и . CP, том 12333 из Lecture Notes in Computer Science, стр. 899-916. Springer, (2020)SHA-256 Collision Attack with Programmatic SAT., , и . CoRR, (2024)CDCL(Crypto) SAT solvers for cryptanalysis., и . CASCON, стр. 311-316. ACM, (2019)Diversifying a Parallel SAT Solver with Bayesian Moment Matching., , , , и . SETTA, том 13649 из Lecture Notes in Computer Science, стр. 227-233. Springer, (2022)A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers., , , , , , и . SAT, том 10491 из Lecture Notes in Computer Science, стр. 251-260. Springer, (2017)On building general modular adders from standard binary arithmetic components., , и . ACSCC, стр. 154-159. IEEE, (2011)CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis.. University of Waterloo, Ontario, Canada, (2020)base-search.net (ftunivwaterloo:oai:uwspace.uwaterloo.ca:10012/15868).