Results 31 to 40 of about 658,149 (257)
Computational and Energy Costs of Cryptographic Algorithms on Handheld Devices [PDF]
, 2011 Networks are evolving toward a ubiquitous model in which heterogeneous devices are interconnected. Cryptographic algorithms are required for developing security solutions that protect network activity. However, the computational and energy limitations
Herrera-Joancomartí, Jordi +4 more
core +1 more source
A cryptographic primitive based on hidden-order groups
Journal of Mathematical Cryptology, 2009 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 Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We give a protocol for producing certifiable randomness from a single untrusted quantum device that is polynomial-time bounded. The randomness is certified to be statistically close to uniform from the point of view of any computationally unbounded ...
Zvika Brakerski +4 more
semanticscholar +1 more source
Towards Isogeny-Based Password-Authenticated Key Establishment
Journal of Mathematical Cryptology, 2020 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
Xoodyak, a lightweight cryptographic scheme
IACR Transactions on Symmetric Cryptology, 2020 In this paper, we present Xoodyak, a cryptographic primitive that can be used for hashing, encryption, MAC computation and authenticated encryption. Essentially, it is a duplex object extended with an interface that allows absorbing strings of arbitrary ...
J. Daemen +4 more
semanticscholar +1 more source
Cryptanalysis of a Pairing-free Certificateless Signcryption scheme
ICT Express, 2021 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
Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
IACR Transactions on Symmetric Cryptology, 2018 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
Automatically eliminating speculative leaks from cryptographic code with blade
Proc. ACM Program. Lang., 2020 We introduce Blade, a new approach to automatically and efficiently eliminate speculative leaks from cryptographic code. Blade is built on the insight that to stop leaks via speculative execution, it suffices to cut the dataflow from expressions that ...
Marco Vassena +7 more
semanticscholar +1 more source
A new method for solving the elliptic curve discrete logarithm problem [PDF]
Groups, Complexity, Cryptology, 2021 The elliptic curve discrete logarithm problem is considered a secure cryptographic primitive. The purpose of this paper is to propose a paradigm shift in attacking the elliptic curve discrete logarithm problem.
Ansari Abdullah +2 more
doaj +1 more source
Primitive free cubics with specified norm and trace [PDF]
, 2003 The existence of a primitive free (normal) cubic x3 - ax2 + cx - b over a finite field F with arbitrary specified values of a (≠0) and b (primitive) is guaranteed. This is the most delicate case of a general existence theorem whose proof is thereby
Sophie Huczynska +6 more
core +3 more sources