- Quantum criptography primitives
- Kolmogorov complelity
- Computational complexity
André Souto
Contactos
Departamento de InformáticaSala/Gabinete 6.3.21
Ext. Principal 26704
Telefone Direto 217500087
Email ansouto@ciencias.ulisboa.pt
Carreira Docente Universitário
Categoria Professor Auxiliar
Indicadores
ResearcherIDOrcid
Scopus
Google Scholar
Palavras Chave
Keywords
- Quantum computation
- Kolmogorov complexity
- Cryptography
Currículo Resumido
I made my PhD in FCUP in 2011 on computational and Kolmogorov complexity. In 2012 I got a Pos-Doc scholarship to work on quantum computation, in which I majorly develop my work with special interest into cryptographic applications.
Interesses Científicos
Kolmogorov Complexity; Computacional Complexity; Quantum Computation; Quantum and Classical Criptography;
Scientific Interests
Quantum computation; Kolmogorov complexity; Cryptography
Publicações selecionadas
- P. Branco, P. Mateus, C. Salema, A. Souto, Using Low-Density Parity-Check codes to improve the McEliece cryptosystem, Information Sciences 510, 243-255, 2020 Elsevier
- A. Souto, P. Mateus, P. Adão, N. Paunkovic – Oblivious transfer based on quantum state computational indistinguishability. Journal Physical Review A, 91, 042306, 2015. American Psysical Society – DOI: 10.1103/PhysRevA.91.042306
- M. Lemus, M. Ramos, P. Yadav, N. Silva, N. Muga, A. Souto, N. Paunkovic, P. Mateus, A. Pinto, Generation and Distribution of Quantum Oblivious Keys for Secure Multiparty Computation, Applied Sciences 10 (12): 4080, MDPI, 2020
- P. Yadav, P. Mateus, N. PaunkoviÄ, A. Souto, Contract signing with entangled, Entropy 21 (9): 821, MPDI, 2019
- L. Antunes, A. Souto, P. Vitanyi. On the rate of decrease in logical depth, Theoretical Computer Science, Volume 702, pages 60 - 64, 2017 Elsevier