Results 31 to 40 of about 75,969 (261)
Synonym‐based multi‐keyword ranked search with secure k‐NN in 6G network
IET Networks, EarlyView., 2022 Abstract Sixth Generation (6G) integrates the next generation communication systems such as maritime, terrestrial, and aerial to offer robust network and massive device connectivity with ultra‐low latency requirement. The cutting edge technologies such as artificial intelligence, quantum machine learning, and millimetre enable hyper‐connectivity to ...
Deebak Bakkiam David, Fadi Al‐Turjman
wiley +1 more source
Cryptographic Hash Functions [PDF]
, 2010 Cryptographic hash functions are an important tool of cryptography and play a fundamental role in efficient and secure information processing. A hash function processes an arbitrary finite length input message to a fixed length output referred to as the hash value.
Gauravaram, Praveen, Knudsen, Lars R.
openaire +3 more sources
low complexity cryptographic hash functions [PDF]
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017 Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which
Applebaum, Benny +4 more
openaire +3 more sources
Analysis of the amplitude form of the quantum hash function
Учёные записки Казанского университета: Серия Физико-математические науки, 2023 In this article, the properties of quantum hash functions are further explored. Previous findings show that so-called small-bias sets (special subsets of the set of elements of a cyclic group) generate a “phase” quantum hash function. Here, it was proved
M. F. Ablayev +2 more
doaj +1 more source
A Family of Fast Syndrome Based Cryptographic Hash Functions [PDF]
, 2005 Recently, some collisions have been exposed for a variety of cryptographic hash functions~\cite{WFLY04} including some of the most widely used today. Many other hash functions using similar constrcutions can however still be considered secure. Nevertheless, this has drawn attention on the need for new hash function designs. In this article is presented
Daniel Augot +2 more
openalex +5 more sources
Merkle-Damgård Construction Method and Alternatives: A Review
Journal of Information and Organizational Sciences, 2017 Cryptographic hash function is an important cryptographic tool in the field of information security. Design of most widely used hash functions such as MD5 and SHA-1 is based on the iterations of compression function by Merkle-Damgård construction method ...
Harshvardhan Tiwari
doaj +1 more source
Cryptographic Hash Functions from Expander Graphs [PDF]
Journal of Cryptology, 2007 We propose constructing provable collision resistant hash functions from expander graphs in which finding cycles is hard. As examples, we investigate two specific families of optimal expander graphs for provable collision resistant hash function constructions: the families of Ramanujan graphs constructed by Lubotzky-Phillips-Sarnak and Pizer ...
Denis Charles +2 more
openalex +3 more sources
Reversible and Plausibly Deniable Covert Channels in One-Time Passwords Based on Hash Chains
Applied Sciences, 2021 Covert channels enable stealthy communications over innocent appearing carriers. They are increasingly applied in the network context. However, little work is available that exploits cryptographic primitives in the networking context to establish such ...
Jörg Keller, Steffen Wendzel
doaj +1 more source
Finding state-of-the-art non-cryptographic hashes with genetic programming [PDF]
, 2006 Proceding of: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006.The design of non-cryptographic hash functions by means of evolutionary computation is a relatively new and unexplored problem.
Estébanez Tascón, César +3 more
core +2 more sources
, 2009 We propose the cryptographic hash function Lane as a candidate for the SHA-3 competition organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher are reused as building blocks. Lane aims to
+7 more
core +1 more source