Results 91 to 100 of about 367,345 (251)
Logic Programming with Post-Quantum Cryptographic Primitives for Smart Contract on Quantum-Secured Blockchain [PDF]
, 2021 Xin Sun, Piotr Kulicki, Mirek Sopek
openalex +1 more source
Efficient CCA2 Secure Flexible and Publicly-Verifiable Fine-Grained Access Control in Fog Computing
IEEE Access, 2019 Fog computing enables computation, storage, applications, and network services between the Internet of Things and the cloud servers by extending the Cloud Computing paradigm to the edge of the network.
Dawei Li +3 more
doaj +1 more source
MATRIX ALGORITHMS OF ENCRYPTIC PROTECTION OF INFORMATION AND EXCHANGE OF ENCRYPTION KEY
Ìнформаційні технології в освіті, 2010 The algorithms of the exchange of encryption keys between users of computer networks and cryptographic protection of information transmitted over open communications channels. The algorithm is based a modified asymmetric protocol Diffie-Hellman (DH). The
A. Beletsky, D. Stecenko
doaj
Cryptanalysis of Selected ARX-Based Block Ciphers
Vietnam Journal of Computer ScienceThe security of digital communication and information systems is mostly dependent on block ciphers. ARX-based ciphers are widely used due to their simplicity and efficiency.
Praveen Kumar Gundaram
doaj +1 more source
OPTIMIZED REPRESENTATIONS IN CRYPTOGRAPHIC PRIMITIVES
, 2022 This work focuses on optimization of cryptographic primitives both in theory and in applications. From a theoretical point of view, it addresses the problem of speeding up the polynomial multiplication used in Post-Quantum cryptosystems such as NTRU and McEliece. In particular, the latter extensively uses Galois fields whose elements can be represented
openaire +2 more sources
The least primitive roots mod p
Journal of Mathematical CryptologyLet p>1p\gt 1 be a large prime number, and let ε>0\varepsilon \gt 0 be a small number. The established unconditional upper bounds of the least primitive root u≠±1,v2u\ne \pm 1,{v}^{2} in the prime finite field Fp{{\mathbb{F}}}_{p} have exponential ...
Carella Nelson
doaj +1 more source
A Universally Composable Linkable Ring Signature Supporting Stealth Addresses
MathematicsThe linkable ring signature supporting stealth addresses (SALRS) is a recently proposed cryptographic primitive, which is designed to comprehensively address the soundness and privacy requirements associated with concealing the identities of both the ...
Xingkai Wang, Chunping Zhu, Zhen Liu
doaj +1 more source
The Modification of the Quantum-Resistant AJPS-1 Cryptographic Primitive
, 2023 Dariya Yadukha
openalex +2 more sources
On the Round Security of Symmetric-Key Cryptographic Primitives [PDF]
, 2000 Zulfikar Ramzan, Leonid Reyzin
openalex +1 more source
ARMADILLO: A Multi-purpose Cryptographic Primitive Dedicated to Hardware
Workshop on Cryptographic Hardware and Embedded Systems, 2010 S. Badel +7 more
semanticscholar +1 more source