Results 91 to 100 of about 16,128 (245)
Energy-efficient cryptographic primitives
Facta universitatis - series: Electronics and Energetics, 2018 Our society greatly depends on services and applications provided by mobile communication networks. As billions of people and devices become connected, it becomes increasingly important to guarantee security of interactions of all players. In this talk we address several aspects of this important, many-folded problem.
openaire +3 more sources
Notions of Reducibility between Cryptographic Primitives [PDF]
, 2004 Starting with the seminal paper of Impagliazzo and Rudich [17], there has been a large body of work showing that various cryptographic primitives cannot be reduced to each other via “black-box” reductions. The common interpretation of these results is that there are inherent limitations in using a primitive as a black box, and that these impossibility ...
Salil Vadhan +2 more
openaire +1 more source
On Bitcoin Security in the Presence of Broken Cryptographic Primitives [PDF]
, 2016 Digital currencies like Bitcoin rely on cryptographic primitives to operate. However, past experience shows that cryptographic primitives do not last forever: increased computational power and advanced cryptanalysis cause primitives to break frequently, and motivate the development of new ones.
Giechaskiel, I, Cremers, C, Rasmussen, K
openaire +2 more sources
Cybersecurity, 2019 Dual receiver encryption (DRE) is an important cryptographic primitive introduced by Diament et al. at CCS’04, which allows two independent receivers to decrypt a same ciphertext to obtain the same plaintext.
Yanyan Liu, Daode Zhang, Yi Deng, Bao Li
doaj +1 more source
Pseudo-free families and cryptographic primitives
Journal of Mathematical Cryptology, 2022 Abstract In this article, we study the connections between pseudo-free families of computational Ω \Omega -algebras (in appropriate varieties of
openaire +2 more sources
Hash Functions and Benchmarks for Resource Constrained Passive Devices: A Preliminary Study [PDF]
arXiv, 2019 Recently, we have witnessed the emergence of intermittently powered computational devices, an early example is the Intel WISP (Wireless Identification and Sensing Platform). How we engineer basic security services to realize mutual authentication, confidentiality and preserve privacy of information collected, stored and transmitted by, and establish ...
arxiv
Where's Crypto?: Automated Identification and Classification of Proprietary Cryptographic Primitives in Binary Code [PDF]
arXiv, 2020 The continuing use of proprietary cryptography in embedded systems across many industry verticals, from physical access control systems and telecommunications to machine-to-machine authentication, presents a significant obstacle to black-box security-evaluation efforts. In-depth security analysis requires locating and classifying the algorithm in often
arxiv
The Effect of the Primitive Irreducible Polynomial on the Quality of Cryptographic Properties of Block Ciphers [PDF]
, 2020 Sajjad Shaukat Jamal +3 more
openalex +1 more source
Security Amplification for Interactive Cryptographic Primitives [PDF]
, 2009 Security amplification is an important problem in Cryptography: starting with a "weakly secure" variant of some cryptographic primitive, the goal is to build a "strongly secure" variant of the same primitive. This question has been successfully studied for a variety of important cryptographic primitives, such as one-way functions, collision-resistant ...
Valentine Kabanets +3 more
openaire +2 more sources
Synthesis of all Maximum Length Cellular Automata of Cell Size up to 12 [PDF]
arXiv, 2015 Maximum length CA has wide range of applications in design of linear block code, cryptographic primitives and VLSI testing particularly in Built-In-Self-Test. In this paper, an algorithm to compute all $n$-cell maximum length CA-rule vectors is proposed.
arxiv