Results 51 to 60 of about 213 (104)

On a class of strongly asymmetric PKA algorithms

Journal of Mathematical Cryptology, 2015
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

Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus

, 1997
The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system.
Fachbereich Informatik, Andreas Stein, Christoph Thiel, Volker Müller, Technische Hochschule Darmstadt   +4 more
core  

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

Indifferentiability security of the fast wide pipe hash: Breaking the birthday barrier

Journal of Mathematical Cryptology, 2016
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, Paul Souradyuti, Smith-Tone Daniel   +2 more
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

Analysis of a certain polycyclic-group-based cryptosystem

Journal of Mathematical Cryptology, 2015
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

Journal of Mathematical Cryptology, 2016
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

Tame logarithmic signatures of abelian groups

Journal of Mathematical Cryptology, 2017
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

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

Sherlock Holmes zero-knowledge protocols secure against active attackers

Journal of Mathematical Cryptology
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