Vortex: A new family of one-way hash functions based on AES rounds and carry-less multiplication

Shay Gueron, Michael E. Kounavis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We present Vortex a new family of one way hash functions that can produce message digests of 256 bits. The main idea behind the design of these hash functions is that we use well known algorithms that can support very fast diffusion in a small number of steps. We also balance the cryptographic strength that comes from iterating block cipher rounds with SBox substitution and diffusion (like Whirlpool) against the need to have a lightweight implementation with as small number of rounds as possible. We use only 3 AES rounds but with a stronger key schedule. Our goal is not to protect a secret symmetric key but to support perfect mixing of the bits of the input into the hash value. Three AES rounds are followed by our variant of Galois Field multiplication. This achieves cross-mixing between 128-bit sets. We present a set of qualitative arguments why we believe Vortex is secure.

Original languageEnglish
Title of host publicationInformation Security - 11th International Conference, ISC 2008, Proceedings
Number of pages10
StatePublished - 2008
Event11th International Conference on Information Security, ISC 2008 - Taipei, Taiwan, Province of China
Duration: 15 Sep 200818 Sep 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5222 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th International Conference on Information Security, ISC 2008
Country/TerritoryTaiwan, Province of China

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Vortex: A new family of one-way hash functions based on AES rounds and carry-less multiplication'. Together they form a unique fingerprint.

Cite this