Results 21 to 30 of about 856 (103)
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
Maximum-order Complexity and Correlation Measures
, 2017 We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order $k$ cannot have very small maximum-order ...
Işık, Leyla, Winterhof, Arne
core +1 more source
Journal of Mathematical Cryptology, 2018 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
A trade-off between classical and quantum circuit size for an attack against CSIDH
Journal of Mathematical Cryptology, 2020 We propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪).
Biasse Jean-François +4 more
doaj +1 more source
On the security of the Courtois-Finiasz-Sendrier signature
Open Mathematics, 2018 We prove that a variant of the Courtois-Finiasz-Sendrier signature is strongly existentially unforgeable under chosen message attack in the random oracle model, assuming hardness of the Permuted Goppa Syndrome Decoding Problem (also known as the ...
Morozov Kirill +3 more
doaj +1 more source
Journal of Mathematical Cryptology, 2014 We provide unconditional results and conditional ones under the assumption of GRH (Generalized Riemann Hypothesis) on the distribution of quadratic residues and quadratic non-residues in ℤ/Nℤ$\mathbb {Z}/N\mathbb {Z}$, where N=pq$N= pq$ is an RSA modulus
Justus Benjamin
doaj +1 more source
Exact information ratios for secret sharing on small graphs with girth at least 5
Journal of Mathematical Cryptology, 2019 In a secret-sharing scheme, a piece of information – the secret – is distributed among a finite set of participants in such a way that only some predefined coalitions can recover it.
Harsányi Károly, Ligeti Péter
doaj +1 more source
Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser [PDF]
, 2016 The Algebraic Eraser Diffie-Hellman (AEDH) protocol was introduced in 2005 and published in 2006 by Anshel-Anshel-Goldfeld-Lemieux as a protocol suitable for use on platforms with constrained computational resources, such as FPGAs, ASICs, and wireless ...
Anshel, Iris +3 more
core +1 more source
Expansion complexity and linear complexity of sequences over finite fields
, 2016 The linear complexity is a measure for the unpredictability of a sequence over a finite field and thus for its suitability in cryptography. In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity.
Mérai, László +2 more
core +1 more source