Fast hashing and rotation-symmetric functions

Author: lnwz

August undefined, 2024

WebAn 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. WebNov 1, 2014 · In recent years, rotation symmetric (RotS) functions have proven to be very useful in several areas of cryptography [2, pp. 108–118]. This has led to many papers, which study different aspects of the theory of rotation symmetric functions. Some of these papers are [2-12]. We say a Boolean function is ‘rotation symmetric’ if the algebraic ...

Several infinite families of p-ary weakly regular bent functions

WebMay 1, 2003 · In 1999, Pieprzyk and Qu presented rotation symmetric (RotS) functions as components in the rounds of hashing algorithm. Later, in 2002, Cusick and Stǎnicǎ … WebJan 1, 2006 · 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 … the root of 125

Counting rotation symmetric functions using Polya’s theorem

WebTom St Denis, Greg Rose, in BigNum Math, 2006. 5.3.3 Even Faster Squaring. Just like the case of algorithm fast_mult (Section 5.2.3), squaring can be performed using the full … WebRotation symmetric Boolean functions (RSBFs) that are invariant under circular translation of indices have been used as components of different cryptosystems. In this paper, even-variable-balanced RSBFs with maximum algebraic immunity (AI) are investigated. At first, we give an original construction of 2 m -variable-balanced RSBFs … WebJul 1, 2011 · Rotation symmetric Boolean functions (RSBFs) that are invariant under circular translation of indices have been used as components of different cryptosystems. In this paper, even-variable-balanced ... the root of 160

An In-Depth Guide To Understanding Hash Functions - AppSealing

Fast hashing and rotation-symmetric functions

Hashing Algorithm Overview: Types, Methodologies & Usage

http://emmy.uprrp.edu/lmedina/papers/ShortCycles/Short_Cycle_Rotations_Final.pdf#:~:text=Abstract.%20Rotation%20symmetric%20Boolean%20functions%20were%20introduced%20by,family%20to%20count%20the%20number%20of%20short%20cycles. WebMar 4, 2024 · Rotation symmetric functions are introduced in for the design of fast hash function. Due to their special structure and good algebraic properties, rotation symmetric Boolean functions having cryptographic properties have been investigated extensively, such as bent rotation symmetric Boolean functions [ 3 , 10 ], resilient rotation …

Did you know?

WebNov 1, 2014 · The authors also consider vectorial Boolean functions [that is, maps from GF (2) n to GF (2) m] which are k-rotation symmetric and they give two infinite families of such functions which are permutations with the maximum possible algebraic degree. The families of functions that they give provide a source, which can be searched for … Web1 Introduction. Rotation symmetric Boolean functions (RSBFs), which are invariant under the actions of the cyclic group, have been used as the components in the round of a hashing algorithm and in the implementation of MD4, MD5, and HAVAL 1.It has been experimentally found that RSBFs are extremely rich in Boolean functions with good …

WebMay 1, 2003 · In 1999, Pieprzyk and Qu presented rotation symmetric (RotS) functions as components in the rounds of hashing algorithm. Later, in 2002, Cusick and Stǎnicǎ presented further advancement in this area. This class of Boolean functions are invariant under circular translation of indices. In this paper, using Burnside's lemma, we prove that … WebRotation-Symmetric Functions and Fast Hashing Josef Pieprzyk and Cheng Xin Qu Centre for Computer Security Research School of Information Technology and Computer …

WebIt is shown that shortening of rotation-symmetric functions paradoxically leads to more expensive evaluation process and a new class of Boolean functions whose evaluation is especially eÆcient and they are called rotation symmetric. EÆcient hashing is a … WebOct 31, 2016 · As an optimal combinatorial object, bent functions have been an interesting research object due to their important applications in cryptography, coding theory, and sequence design. The characterization and construction of bent functions are challenging problems in general. The objective of this paper is to present a construction of p-ary …

WebApr 27, 2024 · A hash function is an algorithm that generates a fixed-length result or hash value from a specific input data. It is different from encryption which converts plain text to …

WebMay 2, 2007 · [21] J. Pieprzyk and C. X. Qu. Fast hashing and rotation-symmetric functions. ... (9−1)/2}, were discovered in the class of Rotation Symmetric Boolean Functions (RSBFs), and one year later, this ... the root of 11WebNov 30, 2024 · In this paper, we propose a generic construction of rotation symmetric bent functions by modifying the support of a known class of quadratic rotation symmetric … the root of 136WebAn 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 … the root note