From post

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.

 

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

Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment., , , , , и . CRYPTO (2), том 12171 из Lecture Notes in Computer Science, стр. 62-91. Springer, (2020)Breaking the Encryption Scheme of the Moscow Internet Voting System., и . Financial Cryptography, том 12059 из Lecture Notes in Computer Science, стр. 32-49. Springer, (2020)Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability., , , , , , , и . CCS, стр. 397-410. ACM, (2022)Belenios: A Simple Private and Verifiable Electronic Voting System., , и . Foundations of Security, Protocols, and Equational Reasoning, том 11565 из Lecture Notes in Computer Science, стр. 214-238. Springer, (2019)Deciphering Charles Quint (A diplomatic letter from 1547)., , , и . HistoCrypt, том 195 из Linköping Electronic Conference Proceedings, стр. 148-159. Linköping University Electronic Press, (2023)Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields., , и . CRYPTO (2), том 12171 из Lecture Notes in Computer Science, стр. 32-61. Springer, (2020)Improvements to the number field sieve for non-prime finite fields., , , и . CoRR, (2014)Imperfect forward secrecy: how Diffie-Hellman fails in practice., , , , , , , , , и 4 other автор(ы). Commun. ACM, 62 (1): 106-114 (2019)A Toolbox for Verifiable Tally-Hiding E-Voting Systems., , и . ESORICS (2), том 13555 из Lecture Notes in Computer Science, стр. 631-652. Springer, (2022)Belenios with Cast as Intended., , , и . FC Workshops, том 13953 из Lecture Notes in Computer Science, стр. 3-18. Springer, (2023)