Results 61 to 70 of about 384,292 (296)
Many public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that a ...
Crescenzo Giovanni Di+3 more
doaj +1 more source
Robust Combiners and Universal Constructions for Quantum Cryptography [PDF]
A robust combiner combines many candidates for a cryptographic primitive and generates a new candidate for the same primitive. Its correctness and security hold as long as one of the original candidates satisfies correctness and security. A universal construction is a closely related notion to a robust combiner. A universal construction for a primitive
arxiv
Remarks on the Cryptographic Primitive of Attribute-based Encryption [PDF]
Attribute-based encryption (ABE) which allows users to encrypt and decrypt messages based on user attributes is a type of one-to-many encryption. Unlike the conventional one-to-one encryption which has no intention to exclude any partners of the intended
Cao, Zhengjun, Liu, Lihua
core +1 more source
Artificial Intelligence for the Design of Symmetric Cryptographic Primitives
This chapter provides a general overview of AI methods used to support the design of cryptographic primitives and protocols. After giving a brief introduction to the basic concepts underlying the field of cryptography, we review the most researched use cases concerning the use of AI techniques and models to design cryptographic primitives, focusing ...
Mariot, L.+3 more
openaire +5 more sources
Physically Unclonable Function Utilizing Stochastic Indirect Exchange Interaction
A physically unclonable function (PUF) utilizes manufacturing variations to create secret keys. This study proposes a spin–orbit torque PUF model based on the Ruderman–Kittel–Kasuya–Yosida interaction. It features near‐ideal properties that can operate under zero magnetic field and varying temperatures.
Jeong Kyu Lee+3 more
wiley +1 more source
Variable Bit Permutations: Linear Characteristics and Pure VBP-Based Cipher [PDF]
This paper describes linear characteristics of the variable bit permutations (VBP) that are used in the form of the data-dependent permutations. This primitive suites well to the design of fast cheap-hardware-oriented ciphers. Because of the existence of
N.A. Moldovyan+2 more
doaj
One-time memory from isolated Majorana islands
A one-time memory (OTM) stores two bits such that either bit can be retrieved, but not both. One-time memories have been shown to allow for secure classical and quantum computations.
Sourav Kundu, Ben Reichardt
doaj +1 more source
Towards Automated Augmentation and Instrumentation of Legacy Cryptographic Executables: Extended Version [PDF]
Implementation flaws in cryptographic libraries, design flaws in underlying cryptographic primitives, and weaknesses in protocols using both, can all lead to exploitable vulnerabilities in software. Manually fixing such issues is challenging and resource consuming, especially when maintaining legacy software that contains broken or outdated ...
arxiv
Automated Cryptographic Analysis of the Pedersen Commitment Scheme
Aiming for strong security assurance, recently there has been an increasing interest in formal verification of cryptographic constructions. This paper presents a mechanised formal verification of the popular Pedersen commitment protocol, proving its ...
Dong, Changyu, Metere, Roberto
core +1 more source
Perturbation-Based Schemes with Ultra-Lightweight Computation to Protect User Privacy in Smart Grid
In smart grid, smart meters are deployed to collect power consumption data periodically, and the data are analyzed to improve the efficiency of power transmission and distribution.
Wei Ren, Liangli Ma, Yi Ren
doaj +1 more source