Results 51 to 60 of about 774 (86)
A note on some algebraic trapdoors for block ciphers
We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al.
Calderini, Marco
core
On a class of strongly asymmetric PKA algorithms
In the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka ...
Accardi Luigi, Regoli Massimo
doaj +1 more source
On implementation of Stickel's key exchange protocol over max-min and max-T semirings
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
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
Indifferentiability security of the fast wide pipe hash: Breaking the birthday barrier
A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all meaningful generic attacks. Such hash functions also play a crucial role in establishing the security of protocols that use them as random functions.
Moody Dustin +2 more
doaj +1 more source
Analysis of a certain polycyclic-group-based cryptosystem
We investigate security properties of the Anshel–Anshel–Goldfeld commutator key-establishment protocol [Math. Res. Lett. 6 (1999), 287–291] used with certain polycyclic groups described by Eick and Kahrobaei [http://arxiv.org/abs/math.GR/0411077].
Kotov Matvei, Ushakov Alexander
doaj +1 more source
Compression for trace zero points on twisted Edwards curves
We propose two optimal representations for the elements of trace zero subgroups of twisted Edwards curves. For both representations, we provide efficient compression and decompression algorithms.
Bianco Giulia, Gorla Elisa
doaj +1 more source
Differential and Linear properties of vectorial boolean functions based on chi. [PDF]
Mella S, Mehrdad A, Daemen J.
europepmc +1 more source
Stream cipher based on quasigroup string transformations in $Z_p^*$
In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group $\bbbz_p^*$ (where p is a big prime number used in ElGamal algorithm), by defining a quasigroup of order $p-1$ and by doing quasigroup string ...
Gligoroski, Danilo
core +1 more source
Sherlock Holmes zero-knowledge protocols secure against active attackers
We present two simple zero-knowledge interactive proofs that can be instantiated with many of the standard decisional or computational hardness assumptions.
Teşeleanu George
doaj +1 more source

