The circulant hash revisited
Autor(a) principal: | |
---|---|
Data de Publicação: | 2020 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10316/101225 https://doi.org/10.1515/jmc-2018-0054 |
Resumo: | At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes based on matrix-vector multiplication over F2. In this paper we revisit the circulant hash and reinterpret it as a multiplication in the polynomial ring F2[x]/(xn + 1). This leads to simpler proofs, faster implementations in modern computer chips, and newer variants with practical implementation advantages. |
id |
RCAP_1697a0d5c5fca9dc774a9ef47e3ae8e6 |
---|---|
oai_identifier_str |
oai:estudogeral.uc.pt:10316/101225 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
The circulant hash revisitedcirculant hashalmost universal hashdata-dependent rotationAt ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes based on matrix-vector multiplication over F2. In this paper we revisit the circulant hash and reinterpret it as a multiplication in the polynomial ring F2[x]/(xn + 1). This leads to simpler proofs, faster implementations in modern computer chips, and newer variants with practical implementation advantages.2020info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/101225http://hdl.handle.net/10316/101225https://doi.org/10.1515/jmc-2018-0054eng1862-2984Araújo, FilipeNeves, Samuelinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2022-08-17T23:02:18Zoai:estudogeral.uc.pt:10316/101225Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:18:28.084935Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
The circulant hash revisited |
title |
The circulant hash revisited |
spellingShingle |
The circulant hash revisited Araújo, Filipe circulant hash almost universal hash data-dependent rotation |
title_short |
The circulant hash revisited |
title_full |
The circulant hash revisited |
title_fullStr |
The circulant hash revisited |
title_full_unstemmed |
The circulant hash revisited |
title_sort |
The circulant hash revisited |
author |
Araújo, Filipe |
author_facet |
Araújo, Filipe Neves, Samuel |
author_role |
author |
author2 |
Neves, Samuel |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Araújo, Filipe Neves, Samuel |
dc.subject.por.fl_str_mv |
circulant hash almost universal hash data-dependent rotation |
topic |
circulant hash almost universal hash data-dependent rotation |
description |
At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes based on matrix-vector multiplication over F2. In this paper we revisit the circulant hash and reinterpret it as a multiplication in the polynomial ring F2[x]/(xn + 1). This leads to simpler proofs, faster implementations in modern computer chips, and newer variants with practical implementation advantages. |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10316/101225 http://hdl.handle.net/10316/101225 https://doi.org/10.1515/jmc-2018-0054 |
url |
http://hdl.handle.net/10316/101225 https://doi.org/10.1515/jmc-2018-0054 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1862-2984 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799134079147311104 |