Results 41 to 50 of about 241 (86)

A subexponential construction of graph coloring for multiparty computation

Journal of Mathematical Cryptology, 2014
We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any ...
Asghar Hassan Jameel, Desmedt Yvo, Pieprzyk Josef, Steinfeld Ron   +3 more
doaj   +1 more source

On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes

Journal of Mathematical Cryptology, 2020
S-box is the basic component of symmetric cryptographic algorithms, and its cryptographic properties play a key role in security of the algorithms.
Zhou Yu, Mu Daoguang, Dong Xinfeng
doaj   +1 more source

On the security of joint signature and encryption revisited

Journal of Mathematical Cryptology, 2016
In 2002, An et al. [1] proposed three generic conversions of signcryption, ℰ⁢t⁢𝒮${\mathcal{E}t\mathcal{S}}$, 𝒮⁢t⁢ℰ${\mathcal{S}t\mathcal{E}}$ and 𝒞⁢t⁢ℰ&𝒮${\mathcal{C}t\mathcal{E}\&\mathcal{S}}$ from the primitive encryption scheme and signature scheme ...
Nandi Mridul, Pandit Tapas
doaj   +1 more source

Approximate Voronoi cells for lattices, revisited

Journal of Mathematical Cryptology, 2020
We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis–Laarhoven–De Weger [PQCrypto, 2019] of determining exact ...
Laarhoven Thijs
doaj   +1 more source

Improved lower bound for Diffie–Hellman problem using multiplicative group of a finite field as auxiliary group

Journal of Mathematical Cryptology, 2018
In 2004, Muzereau, Smart and Vercauteren [A. Muzereau, N. P. Smart and F. Vercauteren, The equivalence between the DHP and DLP for elliptic curves used in practical applications, LMS J. Comput. Math. 7 2004, 50–72] showed how to use a reduction algorithm
Kushwaha Prabhat
doaj   +1 more source

Towards a Ring Analogue of the Leftover Hash Lemma

Journal of Mathematical Cryptology, 2020
The leftover hash lemma (LHL) is used in the analysis of various lattice-based cryptosystems, such as the Regev and Dual-Regev encryption schemes as well as their leakage-resilient counterparts. The LHL does not hold in the ring setting, when the ring is
Dachman-Soled Dana, Gong Huijing, Kulkarni Mukul, Shahverdi Aria   +3 more
doaj   +1 more source

The circulant hash revisited

Journal of Mathematical Cryptology, 2020
At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes
Araujo Filipe, Neves Samuel
doaj   +1 more source

On implementation of Stickel's key exchange protocol over max-min and max-T semirings

Journal of Mathematical Cryptology
Given that the tropical Stickel protocol and its variants are all vulnerable to the generalized Kotov–Ushakov attack, we suggest employing the max-min semiring and, more generally, max-TT semiring where the multiplication is based on a TT-norm, as a ...
Alhussaini Sulaiman, Sergeev Sergeĭ
doaj   +1 more source

Application of Mordell–Weil lattices with large kissing numbers to acceleration of multiscalar multiplication on elliptic curves

Journal of Mathematical Cryptology
This article aims to speed up (the precomputation stage of) multiscalar multiplication (MSM) on ordinary elliptic curves of j-invariant 0 with respect to specific “independent” (also known as “basis”) points.
Koshelev Dmitrii
doaj   +1 more source

Differential and Linear properties of vectorial boolean functions based on chi. [PDF]

Cryptogr Commun, 2023
Mella S, Mehrdad A, Daemen J.
europepmc   +1 more source