Results 201 to 210 of about 367,345 (251)
Provably lightweight and secure IoHT scheme with post-quantum cryptography and fog computing: A comprehensive scheme for healthcare system. [PDF]
Abood EW +4 more
europepmc +1 more source
Key derivation function: key-hash based computational extractor and stream based pseudorandom expander. [PDF]
Chuah CW, Harun NZ, Hamid IRA.
europepmc +1 more source
Efficient and Secure Implementations of Lightweight Symmetric Cryptographic Primitives
Dumitru Daniel Dinu
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Laser & Photonics reviews, 2021
The development of high density and security information encryption system, in particular narrowband luminescence cryptographic primitive, is of notable significance but extremely challenging for anticounterfeiting applications.
Zhongwei Man +6 more
semanticscholar +1 more source
The development of high density and security information encryption system, in particular narrowband luminescence cryptographic primitive, is of notable significance but extremely challenging for anticounterfeiting applications.
Zhongwei Man +6 more
semanticscholar +1 more source
Cryptographic Primitives with Hinting Property
Journal of Cryptology, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alamati, Navid, Patranabis, Sikhar
openaire +2 more sources
AIM: Symmetric Primitive for Shorter Signatures with Stronger Security
IACR Cryptology ePrint Archive, 2023Post-quantum signature schemes based on the MPC-in-the-Head (MPCitH) paradigm are recently attracting significant attention as their security solely depends on the one-wayness of the underlying primitive, providing diversity for the hardness assumption ...
Seong-Hak Kim +10 more
semanticscholar +1 more source
Making Cryptographic Primitives Harder
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008This paper studies a method for transforming ordinary cryptographic primitives to new harder primitives. Such a method is expected to lead to general schemes that make present cryptosystems secure against the attack of quantum computers. We propose a general technique to construct a new function from an ordinary primitive function f with a help of ...
S. HASEGAWA +4 more
openaire +1 more source

