Results 1 to 10 of about 108 (89)
On Codes Over R and its Bounds of Some kind of Block Repetition Codes in R
This correspondence determines the lower and upper bounds of the covering radius in some kind of block repetition codes over the finite ring R=Z_2 Z_*, where Z_*=Z_2+vZ_2+v^2 Z_2, v^3=v.
P Chella Pandian
doaj +2 more sources
Cryptanalysis of some nonabelian group-based key exchange protocols. [PDF]
In the recently emerging field of nonabelian group-based cryptography, a prominently used one-way function is the conjugacy search problem (CSP), and two important classes of platform groups are polycyclic and matrix groups. In this paper, we discuss the
Tinani S, Matteotti C, Rosenthal J.
europepmc +2 more sources
Reproducible families of codes and cryptographic applications
Structured linear block codes such as cyclic, quasi-cyclic and quasi-dyadic codes have gained an increasing role in recent years both in the context of error control and in that of code-based cryptography.
Santini Paolo +2 more
doaj +1 more source
Revocable attribute-based proxy re-encryption
Attribute-based proxy re-encryption (ABPRE), which combines the notions of proxy re-encryption (PRE) and attribute-based encryption (ABE), allows a semi-trusted proxy with re-encryption key to transform a ciphertext under a particular access policy into ...
Luo Fucai, Al-Kuwari Saif
doaj +1 more source
The Oribatida v1.3 Family of Lightweight Authenticated Encryption Schemes
Permutation-based modes have been established for lightweight authenticated encryption, as can be seen from the high interest in the ongoing NIST lightweight competition.
Bhattacharjee Arghya +3 more
doaj +1 more source
New Zémor-Tillich Type Hash Functions Over GL2 (𝔽pn)
We present a large class of new Zémor-Tillich type hash functions whose target space is the finite group GL2(𝔽pn) for any prime p and power n. To do so, we use a novel group-theoretic approach that uses Tits’ “Ping-Pong Lemma” to outline conditions under
Tomkins Hayley +2 more
doaj +1 more source
A note on secure multiparty computation via higher residue symbols
We generalize a protocol by Yu for comparing two integers with relatively small difference in a secure multiparty computation setting. Yu's protocol is based on the Legendre symbol.
Cascudo Ignacio, Schnyder Reto
doaj +1 more source
On sunlet graphs connected to a specific map on {1, 2, . . . , p − 1} [PDF]
In this article, we study the structure of the graph implied by a given map on the set Sp = {1, 2, . . . , p − 1}, where p is an odd prime. The consecutive applications of the map generate an integer sequence, or in graph theoretical context a walk ...
Németh, László +2 more
core +1 more source
Discretisation and Product Distributions in Ring-LWE
A statistical framework applicable to Ring-LWE was outlined by Murphy and Player (IACR eprint 2019/452). Its applicability was demonstrated with an analysis of the decryption failure probability for degree-1 and degree-2 ciphertexts in the homomorphic ...
Murphy Sean, Player Rachel
doaj +1 more source
Orienting supersingular isogeny graphs
We introduce a category of 𝓞-oriented supersingular elliptic curves and derive properties of the associated oriented and nonoriented ℓ-isogeny supersingular isogeny graphs.
Colò Leonardo, Kohel David
doaj +1 more source

