Results 1 to 10 of about 1,355 (213)
Non-cryptographic primitive for pseudorandom permutation [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iwata, Tetsu +2 more
openaire +1 more source
Locating Side Channel Leakage in Time through Matched Filters
Side channel attacks provide an effective way to extract secret information from the execution of cryptographic algorithms run on a variety of computing devices.
Alessandro Barenghi +2 more
doaj +1 more source
Homomorphic signcryption with public plaintext‐result checkability
Signcryption originally proposed by Zheng (CRYPTO′97) is a useful cryptographic primitive that provides strong confidentiality and integrity guarantees.
Shimin Li +3 more
doaj +1 more source
A Novel Design of Cryptographic SP-Network Based on Gold Sequences and Chaotic Logistic Tent System
Substitution permutation network (SP-network) is a chain of linked mathematical primitives used in block cipher algorithms. The proposed novel design of cryptographic SP-network consists of three cryptographic primitives: substitution box, permutation ...
Muhammad Fahad Khan +3 more
doaj +1 more source
Key Assignment Scheme with Authenticated Encryption
The Key Assignment Scheme (KAS) is a well-studied cryptographic primitive used for hierarchical access control (HAC) in a multilevel organisation where the classes of people with higher privileges can access files of those with lower ones.
Suyash Kandele, Souradyuti Paul
doaj +1 more source
Towards Isogeny-Based Password-Authenticated Key Establishment
Password authenticated key establishment (PAKE) is a cryptographic primitive that allows two parties who share a low-entropy secret (a password) to securely establish cryptographic keys in the absence of public key infrastructure.
Taraskin Oleg +3 more
doaj +1 more source
Cryptanalysis of a Pairing-free Certificateless Signcryption scheme
Signcryption is a very useful cryptographic primitive that aims to achieve authentication and confidentiality in an efficient manner. We cryptanalyze the signcryption scheme of Wei and Ma (2019) which is claimed to be secure.
Philemon Kasyoka +2 more
doaj +1 more source
A cryptographic primitive based on hidden-order groups
Let G1 be a cyclic multiplicative group of order n. It is known that the computational Diffie–Hellman (CDH) problem is random self-reducible in G1 if φ(n) is known.
Saxena Amitabh, Soh Ben
doaj +1 more source
A device-independent protocol for XOR oblivious transfer [PDF]
Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. Ideally, Alice should not learn Bob's desired function choice and Bob should not learn any more than what is logically implied by the ...
Srijita Kundu +2 more
doaj +1 more source
Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
Cryptographic hashing modes come in many flavors, including Merkle-Damgård with various types of strengthening, Merkle trees, and sponge functions. As underlying primitives, these functions use arbitrary functions, permutations, or block ciphers. In this
Joan Daemen +2 more
doaj +1 more source

