## Abstract

Efficient hashing is a centerpiece of modern Cryptography. The progress in computing technology enables us to use 64-bit machines with the promise of 128-bit machines in the near future. To exploit fully the technology for fast hashing, we need to be able to design cryptographically strong Boolean functions in many variables which can be evaluated faster using partial evaluations from the previous rounds. We introduce a new class of Boolean functions whose evaluation is especially efficient and we call them rotation symmetric. Basic cryptographic properties of rotation-symmetric functions are investigated in a broader context of symmetric functions. An algorithm for the design of rotation-symmetric functions is given and two classes of functions are examined. These classes are important from a practical point of view as their forms are short. We show that shortening of rotation-symmetric functions paradoxically leads to more expensive evaluation process.

Original language | English |
---|---|

Pages (from-to) | 20-31 |

Number of pages | 12 |

Journal | Journal of Universal Computer Science |

Volume | 5 |

Issue number | 1 |

Publication status | Published - 1999 |

Externally published | Yes |