Results 21 to 30 of about 696 (69)

On the supersingular GPST attack

Journal of Mathematical Cryptology, 2021
The main attack against static-key supersingular isogeny Diffie–Hellman (SIDH) is the Galbraith–Petit–Shani–Ti (GPST) attack, which also prevents the application of SIDH to other constructions such as non-interactive key-exchange.
Basso Andrea, Pazuki Fabien
doaj   +1 more source

A framework for cryptographic problems from linear algebra

Journal of Mathematical Cryptology, 2020
We introduce a general framework encompassing the main hard problems emerging in lattice-based cryptography, which naturally includes the recently proposed Mersenne prime cryptosystem, but also problems coming from code-based cryptography.
Bootland Carl, Castryck Wouter, Szepieniec Alan, Vercauteren Frederik   +3 more
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

The circulant hash revisited

Journal of Mathematical Cryptology, 2020
At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes
Araujo Filipe, Neves Samuel
doaj   +1 more source

On deep holes of generalized Reed-Solomon codes

, 2016
Determining deep holes is an important topic in decoding Reed-Solomon codes. In a previous paper [8], we showed that the received word $u$ is a deep hole of the standard Reed-Solomon codes $[q-1, k]_q$ if its Lagrange interpolation polynomial is the sum ...
Hong, Shaofang, Wu, Rongjun
core   +2 more sources

Constructing Permutation Rational Functions From Isogenies

, 2017
A permutation rational function $f\in \mathbb{F}_q(x)$ is a rational function that induces a bijection on $\mathbb{F}_q$, that is, for all $y\in\mathbb{F}_q$ there exists exactly one $x\in\mathbb{F}_q$ such that $f(x)=y$.
Bisson, Gaetan, Tibouchi, Mehdi
core   +2 more sources

Can we Beat the Square Root Bound for ECDLP over 𝔽p2 via Representation?

Journal of Mathematical Cryptology, 2020
We give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field 𝔽p2. Using the representation technique, we reduce ECDLP to a multivariate polynomial zero testing problem.
Delaplace Claire, May Alexander
doaj   +1 more source

On the quantum security of high-dimensional RSA protocol

Journal of Mathematical Cryptology
The idea of extending the classical RSA protocol using algebraic number fields was introduced by Takagi and Naito (Construction of RSA cryptosystem over the algebraic field using ideal theory and investigation of its security.
Rahmani Nour-eddine, Serraj Taoufik, Ismaili Moulay Chrif, Azizi Abdelmalek   +3 more
doaj   +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ó, Niederreiter, Harald, Winterhof, Arne   +2 more
core   +1 more source

BTLE: Atomic swaps with time-lock puzzles

Journal of Mathematical Cryptology
We present BTLE (Broadcast Time-Lock Exchange Protocol), a two-step protocol that aims to decentralize exchange of funds between two blockchains in scenarios similar to online exchanges. BTLE leverages time-lock puzzles to achieve that.
Barbara Fadi, Guglielmino Enrico, Murru Nadir, Schifanella Claudio   +3 more
doaj   +1 more source