Results 51 to 60 of about 778 (85)
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
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
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
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
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
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
Tame logarithmic signatures of abelian groups
The security of the asymmetric cryptosystem MST1{{}_{1}} relies on the hardness of factoring group elements with respect to a logarithmic signature. In this paper we investigate the factorization problem with respect to logarithmic signatures of abelian ...
Reichl Dominik
doaj +1 more source
Composite order pairing setting has been used to achieve cryptographic functionalities beyond what is attainable in prime order groups. However, such pairings are known to be significantly slower than their prime order counterparts.
Chatterjee Sanjit +2 more
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

