Results 1 to 10 of about 1,359 (88)
The power of primes: security of authentication based on a universal hash-function family [PDF]
Journal of Mathematical Cryptology, 2010 Message authentication codes (MACs) based on universal hash-function families are becoming increasingly popular due to their fast implementation. In this paper, we investigate a family of universal hash functions that has been appeared repeatedly in the ...
Alomair Basel +2 more
doaj +5 more sources
Source Coding Using Families of Universal Hash Functions [PDF]
IEEE Transactions on Information Theory, 2007 This correspondence is concerned with new connections between source coding and two kinds of families of hash functions known as the families of universal hash functions and N-strongly universal hash functions, where N ges 2 is an integer. First, it is pointed out that such families contain classes of well-known source codes such as bin codes and ...
Hiroki Koga
exaly +3 more sources
On the relationships between perfect nonlinear functions and universal hash families
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
, Lusheng Chen
exaly +4 more sources
In search of mathematical primitives for deriving universal projective hash families [PDF]
Applicable Algebra in Engineering, Communication and Computing, 2008 We provide some guidelines for deriving new projective hash families of cryptographic interest. Our main building blocks are so called group action systems; we explore what properties of this mathematical primitives may lead to the construction of cryptographically useful projective hash families.
María Isabel González Vasco +1 more
openaire +4 more sources
On Protecting SPHINCS+ Against Fault Attacks
Transactions on Cryptographic Hardware and Embedded Systems, 2023 SPHINCS+ is a hash-based digital signature scheme that was selected by NIST in their post-quantum cryptography standardization process. The establishment of a universal forgery on the seminal scheme SPHINCS was shown to be feasible in practice by ...
Aymeric Genêt
doaj +1 more source
Universal hash functions from quantum procedures
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power.
F.M. Ablayev, M.T. Ziatdinov
doaj +1 more source
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes [PDF]
International Journal of Foundations of Computer Science, 2018 Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH[Formula: see text], which was shown to be [Formula: see text]-universal by Halevi and Krawczyk in 1997, is a well-known universal hash function family. We introduce a variant of MMH[Formula: see text], that we call GRDH, where we use an
Khodakhast Bibak +3 more
openaire +3 more sources
Pseudo-free families of computational universal algebras
Journal of Mathematical Cryptology, 2020 Let Ω be a finite set of finitary operation symbols. We initiate the study of (weakly) pseudo-free families of computational Ω-algebras in arbitrary varieties of Ω-algebras.
Anokhin Mikhail
doaj +1 more source
IACR Transactions on Symmetric Cryptology, 2017 This paper introduces QARMA, a new family of lightweight tweakable block ciphers targeted at applications such as memory encryption, the generation of very short tags for hardware-assisted prevention of software exploitation, and the construction of ...
Roberto Avanzi
doaj +1 more source
Almost Universal Hash Families are also Storage Enforcing
CoRR, 2012 arXiv admin note: substantial text overlap with arXiv:1104 ...
Mohammad Iftekhar Husain +3 more
openaire +3 more sources