The most efficient indifferentiable hashing to elliptic curves of j-invariant 1728
Journal of Mathematical Cryptology, 2022 This article makes an important contribution to solving the long-standing problem of whether all elliptic curves can be equipped with a hash function (indifferentiable from a random oracle) whose running time amounts to one exponentiation in the basic ...
Koshelev Dmitrii
doaj +1 more source
A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes [PDF]
Groups, Complexity, Cryptology, 2020 A fault injection framework for the decryption algorithm of the Niederreiter public-key cryptosystem using binary irreducible Goppa codes and classical decoding techniques is described. In particular, we obtain low-degree polynomial equations in parts of
Julian Danner, Martin Kreuzer
doaj +1 more source
Application of automorphic forms to lattice problems
Journal of Mathematical Cryptology, 2022 In this article, we propose a new approach to the study of lattice problems used in cryptography. We specifically focus on module lattices of a fixed rank over some number field.
Düzlü Samed, Krämer Juliane
doaj +1 more source
Lattice polytopes in coding theory [PDF]
, 2014 In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes.
Soprunov, Ivan
core +5 more sources
New approach to practical leakage-resilient public-key cryptography
Journal of Mathematical Cryptology, 2020 We present a new approach to construct several leakage-resilient cryptographic primitives, including leakage-resilient public-key encryption (PKE) schemes, authenticated key exchange (AKE) protocols and low-latency key exchange (LLKE) protocols.
Chakraborty Suvradip +2 more
doaj +1 more source
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives [PDF]
, 2017 In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.Comment: 8 ...
Gadiyar, H. Gopalakrishna, Padma, R.
core +3 more sources
Hash functions from superspecial genus-2 curves using Richelot isogenies
Journal of Mathematical Cryptology, 2020 In 2018 Takashima proposed a version of Charles, Goren and Lauter’s hash function using Richelot isogenies, starting from a genus-2 curve that allows for all subsequent arithmetic to be performed over a quadratic finite field 𝔽p2.
Castryck Wouter +2 more
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
Equidistribution Among Cosets of Elliptic Curve Points in Intervals
Journal of Mathematical Cryptology, 2020 In a recent paper devoted to fault analysis of elliptic curve-based signature schemes, Takahashi et al. (TCHES 2018) described several attacks, one of which assumed an equidistribution property that can be informally stated as follows: given an elliptic ...
Kim Taechan, Tibouchi Mehdi
doaj +1 more source
Codes parameterized by the edges of a bipartite graph with a perfect matching
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 In this paper we study the main characteristics of some evaluation codes parameterized by the edges of a bipartite graph with a perfect matching.
Sarabia Manuel González +1 more
doaj +1 more source