Results 111 to 120 of about 375,459 (282)
On Formal Verification of Arithmetic-Based Cryptographic Primitives [PDF]
, 2009 Cryptographic primitives are fundamental for information security: they are used as basic components for cryptographic protocols or public-key cryptosystems. In many cases, their security proofs consist in showing that they are reducible to computationally hard problems. Those reductions can be subtle and tedious, and thus not easily checkable.
openaire +3 more sources
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
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
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems [PDF]
, 2009 Benny Applebaum +3 more
openalex +1 more source
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
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
On the cryptographic properties of “Limonnik-3” AKE scheme
Безопасность информационных технологий, 2019 We study the “Limonnik-3” authenticated key exchange protocol which is a part of Standardization recommendations R 1323565.1.004-2017 “Authenticated key agreement schemes based on public keys”, officially adopted in Russia in 2017, alongside with the ...
Sergey V. Grebnev
doaj +1 more source
THE DYNAMIC CIPHERS – NEW CONCEPT OF LONG-TERM CONTENT PROTECTING [PDF]
In the paper the original concept of a new cipher, targeted at this moment forcivil applications in technology (e.g. measurement and control systems) and business (e.g.content protecting, knowledge-based companies or long-term archiving systems) is ...
Grzegorz Szewczyk
core
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