Fast hashing and rotation-symmetric functions
WebOct 16, 2024 · Pieprzyk J and Qu C, Fast Hashing and rotation symmetric functions, Journal of Universal Computer Science, 1999, 5(1): 20–31. MathSciNet Google Scholar Rijmen V, Barreto P, and Filho D, Rotation symmetry in algebraically generated cryptographic substitution tables, Information Processing Letters, 2008, 106: 246–250. WebNov 30, 2024 · Rotation symmetric bent functions are a special class of Boolean functions, and their construction is of theoretical and practical interest. 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 bent functions, which …
Fast hashing and rotation-symmetric functions
Did you know?
WebMay 31, 2014 · Proof. In order to count the number of n -variable balanced rotation symmetric Boolean functions, N n, we divide the 2 n elements of ( GF ( 2)) n into two groups A n and B n of equal size 2 n − 1. Since the function that we are considering is rotation symmetric, the vectors in the same orbit must be in the same group. WebMay 31, 2014 · Rotation symmetric Boolean functions were first introduced by Pieprzyk and Qu in 1999 [11] and used as components in hashing algorithms to speed up the …
WebRotation-Symmetric Functions and Fast Hashing; Article . Free Access. Share on. Rotation-Symmetric Functions and Fast Hashing. Authors: Josef Pieprzyk. View … 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 ...
WebDec 31, 2003 · In this paper we present a constructive detection of minimal monomials in the algebraic normal form of rotation symmetric Boolean functions (immune to circular translation of indices). ... Fast evaluation, weights and nonlinearity of rotation-symmetric functions, Discrete Math. 258 (1-3) (2002) 289-301. ... Fast hashing and rotation … 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 …
WebDec 3, 2011 · Stanica P, Maitra S, Clark J. Results on rotation symmetric bent and correlation immune Boolean functions. In: Proceedings of Fast Software Encryption Workshop, Delhi, India, 2004. 161–177. Pieprzyk J, Qu C X. Fast hashing and rotation-symmetric functions. J Univ Comput Sci, 1999, 5: 20–31. MathSciNet Google Scholar …
total comfort humidifier homedicsWebFeb 28, 2024 · A new construction of rotation symmetric bent functions with maximal algebraic degree Sihong Su, School of Mathematics and Statistics, Henan University, Kaifeng 475004, China ... J. Pieprzyk and C. Qu, Fast hashing and rotation-symmetric functions, J. Univ. Comput. Sci., 5 (1999), ... total comfort homedics humidifierWebTom 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 … total comfort home careWebFast Hashing and Rotation-Symmetric Functions. Efficient hashing is a centerpiece of modern Cryptography. The progress in computing technology enables us to use 64-bit … total comfort heating and cooling kansas cityWebJul 1, 2024 · Rotation symmetric bent functions and their generation two-rotation symmetric bent functions are two classes of cryptographically significant Boolean functions. However, few constructions have been presented in … total comfort heating and cooling ridgetownWebJan 28, 1999 · 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 … total comfort heating and cooling floridaWeb1 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 … total comfort humidifier plus