Výsledky vyhledávání

Short Variable Length Domain Extenders with Beyond Birthday Bound Security

Autor: Chen, Y.L., Mennink, B., Nandi, M., Peyrin, T.

Publikováno v: Peyrin, T. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part I, 244-274. Cham : Springer
STARTPAGE=244;ENDPAGE=274;ISSN=0302-9743;TITLE=Peyrin, T. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part I
Peyrin, T. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part I, pp. 244-274

Contains fulltext : 200784.pdf (Publisher’s version ) (Open Access) Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f2163cd8fd3885953a0da52238983244
http://hdl.handle.net/2066/200784

Zobrazit plný text záznamu

Cryptanalysis of MORUS

Autor: Ashur, T., Eichlseder, M., Lauridsen, M.M., Leurent, G., Minaud, B., Rotella, Yann, Sasaki, Yu, Viguier, B.G.P., Peyrin, T., Galbraith, S.D.

Publikováno v: Peyrin, T.; Galbraith, S.D. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, pp. 35-64
ASIACRYPT 2018-24th Annual International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2018-24th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2018, Brisbane, Australia. pp.35-64, ⟨10.1007/978-3-030-03329-3_2⟩
Peyrin, T.; Galbraith, S.D. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II, 35-64. Cham : Springer
STARTPAGE=35;ENDPAGE=64;ISSN=0302-9743;TITLE=Peyrin, T.; Galbraith, S.D. (ed.), Advances in Cryptology-ASIACRYPT 2018-24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II
Lecture Notes in Computer Science ISBN: 9783030033286
ASIACRYPT (2)

MORUS is a high-performance authenticated encryption algorithm submitted to the CAESAR competition, and recently selected as a finalist. There are three versions of MORUS: MORUS-640 with a 128-bit key, and MORUS-1280 with 128-bit or 256-bit keys. For

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::216f8f3cdef388bbed1caef4fb8d544c
https://hdl.handle.net/2066/200769

Zobrazit plný text záznamu

Optimizing S-Box Implementations for Several Criteria Using SAT Solvers

Autor: Stoffelen, K., Peyrin, T.

Publikováno v: Fast Software Encryption ISBN: 9783662529928
FSE
Peyrin, T. (ed.), Fast Software Encryption: 23rd International Conference, FSE 2016, Bochum, Germany, March 20-23, 2016, Revised Selected Papers, pp. 140-160
Fast Software Encryption
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Fast Software Encryption
Peyrin, T. (ed.), Fast Software Encryption: 23rd International Conference, FSE 2016, Bochum, Germany, March 20-23, 2016, Revised Selected Papers, 140-160. Berlin, Heidelberg : Springer Berlin Heidelberg
STARTPAGE=140;ENDPAGE=160;ISSN=0302-9743;TITLE=Peyrin, T. (ed.), Fast Software Encryption: 23rd International Conference, FSE 2016, Bochum, Germany, March 20-23, 2016, Revised Selected Papers

We explore the feasibility of applying SAT solvers to optimizing implementations of small functions such as S-boxes for multiple optimization criteria, e.g., the number of nonlinear gates and the number of gates. We provide optimized implementations

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::914597b100b3735d5b16db630bb27a28
https://doi.org/10.1007/978-3-662-52993-5_8

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Quantum Fully Homomorphic Encryption With Verification

Autor: Alagic, G., Dulek, Y., Schaffner, C., Speelman, F., Takagi, T., Peyrin, T.

Publikováno v: Advances in Cryptology – ASIACRYPT 2017 ISBN: 9783319706931
Advances in Cryptology – ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017 : proceedings, 1, 438-467

Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proof

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1839662212d3b5965334dea645411ab
http://arxiv.org/abs/1708.09156

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání