Improving a Compact Cipher Based on Non Commutative Rings of Quaternion
- Autores
- Kamlofsky, Jorge
- Año de publicación
- 2016
- Idioma
- español castellano
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- Asymmetric cryptography is required to start encrypted communications. Most protocols are based on modular operations over integer's rings. Many are vulnerable to sub-exponential attacks or by using a quantum computer. Cryptography based on non-commutative algebra is a growing trend arising as a solid choice that strengthens these protocols. In particular, Hecht (2009) has presented a key exchange model based on the Diffie-Hellman protocol using matrices of order four with elements in Z256, that provides 128-bits keys also to devices with low computing power. Quaternions are four-component's vectors. These also form non-commutative rings structures, with compact notation and lower run-times in many comparable operations. Kamlofsky et al (2015) presented a model using quaternions with elements in Z256. To provide a 128-bit key is required 4 rounds of 32-bits. However, a gain of 42% was obtained. This paper presents an improvement of this cipher that reduces even more the run-times.
V Workshop de Seguridad Informática.
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
criptografía - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/4.0/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/56376
Ver los metadatos del registro completo
id |
SEDICI_b91ea761979610a48b7b2d12e3287ad2 |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/56376 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Improving a Compact Cipher Based on Non Commutative Rings of QuaternionKamlofsky, JorgeCiencias InformáticascriptografíaAsymmetric cryptography is required to start encrypted communications. Most protocols are based on modular operations over integer's rings. Many are vulnerable to sub-exponential attacks or by using a quantum computer. Cryptography based on non-commutative algebra is a growing trend arising as a solid choice that strengthens these protocols. In particular, Hecht (2009) has presented a key exchange model based on the Diffie-Hellman protocol using matrices of order four with elements in Z256, that provides 128-bits keys also to devices with low computing power. Quaternions are four-component's vectors. These also form non-commutative rings structures, with compact notation and lower run-times in many comparable operations. Kamlofsky et al (2015) presented a model using quaternions with elements in Z256. To provide a 128-bit key is required 4 rounds of 32-bits. However, a gain of 42% was obtained. This paper presents an improvement of this cipher that reduces even more the run-times.V Workshop de Seguridad Informática.Red de Universidades con Carreras en Informática (RedUNCI)2016-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1115-1124http://sedici.unlp.edu.ar/handle/10915/56376spainfo:eu-repo/semantics/reference/hdl/10915/55718info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:58:32Zoai:sedici.unlp.edu.ar:10915/56376Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:58:32.738SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Improving a Compact Cipher Based on Non Commutative Rings of Quaternion |
title |
Improving a Compact Cipher Based on Non Commutative Rings of Quaternion |
spellingShingle |
Improving a Compact Cipher Based on Non Commutative Rings of Quaternion Kamlofsky, Jorge Ciencias Informáticas criptografía |
title_short |
Improving a Compact Cipher Based on Non Commutative Rings of Quaternion |
title_full |
Improving a Compact Cipher Based on Non Commutative Rings of Quaternion |
title_fullStr |
Improving a Compact Cipher Based on Non Commutative Rings of Quaternion |
title_full_unstemmed |
Improving a Compact Cipher Based on Non Commutative Rings of Quaternion |
title_sort |
Improving a Compact Cipher Based on Non Commutative Rings of Quaternion |
dc.creator.none.fl_str_mv |
Kamlofsky, Jorge |
author |
Kamlofsky, Jorge |
author_facet |
Kamlofsky, Jorge |
author_role |
author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas criptografía |
topic |
Ciencias Informáticas criptografía |
dc.description.none.fl_txt_mv |
Asymmetric cryptography is required to start encrypted communications. Most protocols are based on modular operations over integer's rings. Many are vulnerable to sub-exponential attacks or by using a quantum computer. Cryptography based on non-commutative algebra is a growing trend arising as a solid choice that strengthens these protocols. In particular, Hecht (2009) has presented a key exchange model based on the Diffie-Hellman protocol using matrices of order four with elements in Z256, that provides 128-bits keys also to devices with low computing power. Quaternions are four-component's vectors. These also form non-commutative rings structures, with compact notation and lower run-times in many comparable operations. Kamlofsky et al (2015) presented a model using quaternions with elements in Z256. To provide a 128-bit key is required 4 rounds of 32-bits. However, a gain of 42% was obtained. This paper presents an improvement of this cipher that reduces even more the run-times. V Workshop de Seguridad Informática. Red de Universidades con Carreras en Informática (RedUNCI) |
description |
Asymmetric cryptography is required to start encrypted communications. Most protocols are based on modular operations over integer's rings. Many are vulnerable to sub-exponential attacks or by using a quantum computer. Cryptography based on non-commutative algebra is a growing trend arising as a solid choice that strengthens these protocols. In particular, Hecht (2009) has presented a key exchange model based on the Diffie-Hellman protocol using matrices of order four with elements in Z256, that provides 128-bits keys also to devices with low computing power. Quaternions are four-component's vectors. These also form non-commutative rings structures, with compact notation and lower run-times in many comparable operations. Kamlofsky et al (2015) presented a model using quaternions with elements in Z256. To provide a 128-bit key is required 4 rounds of 32-bits. However, a gain of 42% was obtained. This paper presents an improvement of this cipher that reduces even more the run-times. |
publishDate |
2016 |
dc.date.none.fl_str_mv |
2016-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/56376 |
url |
http://sedici.unlp.edu.ar/handle/10915/56376 |
dc.language.none.fl_str_mv |
spa |
language |
spa |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/reference/hdl/10915/55718 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
dc.format.none.fl_str_mv |
application/pdf 1115-1124 |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1846064032780386304 |
score |
13.22299 |