Results 201 to 210 of about 621,928 (343)

Cryptanalysis of some chaos-based keyed hash functions

Tongxin xuebao, 2011
By employing the methods including statistic analysis,birthday attacks,and so on,the forging attacks and equivalent-key recovering attacks towards a categories keyed hash functions that are based on chaos systems were pro-posed.Meanwhile,the reasons for ...
ZHENG Shi-hui1, ZHANG Guo-yan3, YANG Yi-xian1, LI Zhong-xian1   +3 more
doaj   +2 more sources

Fast AES-Based Universal Hash Functions and MACs

IACR Transactions on Symmetric Cryptology
Ultra-fast AES round-based software cryptographic authentication/encryption primitives have recently seen important developments, fuelled by the authenticated encryption competition CAESAR and the prospect of future high-profile applications such as ...
Augustin Bariant, Jules Baudrin, Gaëtan Leurent, Clara Pernot, Léo Perrin, Thomas Peyrin   +5 more
doaj   +1 more source

Finding minimal perfect hash functions

, 1986
Gary Haggard, Kevin Karplus
openalex   +1 more source

Cannabinoid therapeutics in orofacial pain management: a systematic review

Australian Dental Journal, Volume 67, Issue 4, Page 314-327, December 2022., 2022
Abstract The objective of this paper was to investigate the published evidence regarding effects of cannabinoids (natural and synthetic) on post‐operative and/or out‐of‐office pain management in patients suffering from orofacial pain that presents in the dental setting.
C Votrubec, P Tran, A Lei, Z Brunet, L Bean, BW Olsen, D Sharma   +6 more
wiley   +1 more source

Skyscraper: Fast Hashing on Big Primes

Transactions on Cryptographic Hardware and Embedded Systems
Arithmetic hash functions defined over prime fields have been actively developed and used in verifiable computation (VC) protocols. Among those, ellipticcurve- based SNARKs require large (256-bit and higher) primes. Such hash functions are notably slow,
Clémence Bouvier, Lorenzo Grassi, Dmitry Khovratovich, Katharina Koschatko, Christian Rechberger, Fabian Schmid, Markus Schofnegger   +6 more
doaj   +1 more source

Design principles for dedicated hash functions

, 1994
Bart Preneel
openalex   +1 more source

SIB: Sorted‐Integers‐Based Index for Compact and Fast Caching in Top‐Down Logic Rule Mining Targeting KB Compression

Software: Practice and Experience, EarlyView.
Background Mining logic rules from structured knowledge bases is the basis of knowledge engineering. Due to the NP‐hardness of the rule mining problem, logic rules cannot be efficiently induced from knowledge bases, especially large‐scale ones.
Ruoyu Wang, Raymond Wong, Daniel Sun, Rajiv Ranjan   +3 more
wiley   +1 more source

Exotic asphyxiation: interactions between invasive species and hypoxia

Biological Reviews, Volume 98, Issue 1, Page 150-167, February 2023., 2023
ABSTRACT Non‐indigenous species (NIS) and hypoxia (<2 mg O2 l−1) can disturb and restructure aquatic communities. Both are heavily influenced by human activities and are intensifying with global change. As these disturbances increase, understanding how they interact to affect native species and systems is essential.
James E. Byers, Julie A. Blaze, Alannah C. Dodd, Hannah L. Hall, Paul E. Gribben   +4 more
wiley   +1 more source

Conductive Hydrogel‐Based Neural Interfaces: From Fabrication Methods, Properties, to Applications

Small Structures, EarlyView.
This review summarizes the fabrication methods, properties, and applications of conductive hydrogels in neural interfaces. Finally, the prevailing challenges and outlines of future directions in the field of conductive hydrogels for neural interfaces are provided, emphasizing the need for interdisciplinary research to address issues such as long‐term ...
Xin‐Yu Xue, Lu Han, He‐Qing Cai, Kou Zhang, Zhi‐Cheng Sun, Ru‐Ping Liu, Tian‐Hao Wang, Fu‐Hong Pan, Wei‐Tao Man, Dong Wang, Juan Liu   +10 more
wiley   +1 more source

Cayley hashing with cookies [PDF]

arXiv
Cayley hash functions are based on a simple idea of using a pair of semigroup elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the semigroup. The main advantage of Cayley hash functions compared to, say, hash functions in the SHA family is that ...
arxiv