dc.creatorKamlofsky, Jorge
dc.creatorHecht, Pedro
dc.date2017-10
dc.date2017-10
dc.date2017-12-05T17:18:47Z
dc.date.accessioned2019-11-21T14:24:00Z
dc.date.available2019-11-21T14:24:00Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/63938
dc.identifierisbn:978-950-34-1539-9
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3040665
dc.descriptionEncrypted communications are performed using symmetric ciphers, which require asymmetric cryptography for safe initiation. Asymmetric cryptography was seriously weakened after the presentation of Shor’s algorithm (1997) and others for quantum computers. New algorithms are generalized as post quantum cryptography. Asymmetric cryptography based on noncommutative algebra is a growing trend arising as a solid choice that strengthens these protocols. Hyper-complex numbers generated by the Cayley-Dickson construction forms non-commutative algebras. This paper focus on the use of these numbers in post-quantum cryptography.
dc.descriptionVI Workshop de Seguridad Informática (WSI).
dc.descriptionRed de Universidades con Carreras en Informática (RedUNCI)
dc.formatapplication/pdf
dc.format1299-1309
dc.languagees
dc.relationXXIII Congreso Argentino de Ciencias de la Computación (La Plata, 2017).
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectCiencias Informáticas
dc.titlePost-Quantum Cryptography Using Hyper-Complex Numbers
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución