Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

Simultaneous Diagonalization of Incomplete Matrices and Applications Coron, Jean-Sébastien ; Notarnicola, Luca ; Wiese, Gabor in Proceedings of the Fourteenth Algorithmic Number Theory Symposium (ANTS-XIV), edited by Steven Galbraith, Open Book Series 4, Mathematical Sciences Publishers, Berkeley, 2020 (2020, December) We consider the problem of recovering the entries of diagonal matrices {U_a}_a for a = 1, . . . , t from multiple “incomplete” samples {W_a}_a of the form W_a = P U_a Q, where P and Q are unknown matrices ... [more ▼] We consider the problem of recovering the entries of diagonal matrices {U_a}_a for a = 1, . . . , t from multiple “incomplete” samples {W_a}_a of the form W_a = P U_a Q, where P and Q are unknown matrices of low rank. We devise practical algorithms for this problem depending on the ranks of P and Q. This problem finds its motivation in cryptanalysis: we show how to significantly improve previous algorithms for solving the approximate common divisor problem and breaking CLT13 cryptographic multilinear maps. [less ▲] Detailed reference viewed: 151 (23 UL)Simultaneous Diagonalization of Incomplete Matrices and Applications Notarnicola, Luca Speeches/Talks (2020) We consider the problem of recovering the entries of diagonal matrices {U_a}_a for a = 1, . . . , t from multiple “incomplete” samples {W_a}_a of the form W_a = P U_a Q, where P and Q are unknown matrices ... [more ▼] We consider the problem of recovering the entries of diagonal matrices {U_a}_a for a = 1, . . . , t from multiple “incomplete” samples {W_a}_a of the form W_a = P U_a Q, where P and Q are unknown matrices of low rank. We devise practical algorithms for this problem depending on the ranks of P and Q. This problem finds its motivation in cryptanalysis: we show how to significantly improve previous algorithms for solving the approximate common divisor problem and breaking CLT13 cryptographic multilinear maps. [less ▲] Detailed reference viewed: 35 (2 UL)Cryptanalysis of CLT13 Multilinear Maps with Independent Slots Coron, Jean-Sébastien ; Notarnicola, Luca Speeches/Talks (2019) Detailed reference viewed: 128 (13 UL)Cryptanalysis of CLT13 Multilinear Maps with Independent Slots Coron, Jean-Sébastien ; Notarnicola, Luca in Advances in Cryptology – ASIACRYPT 2019, 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II (2019, December) Detailed reference viewed: 221 (13 UL)Linear Algebra 2 Wiese, Gabor ; Notarnicola, Luca ; Notarnicola, Massimo Learning material (2017) Detailed reference viewed: 182 (27 UL) |
||