Results 21 to 30 of about 710 (71)
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, 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
The polynomial learning with errors problem and the smearing condition
Journal of Mathematical Cryptology, 2022 As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simplicity and ...
Babinkostova Liljana +4 more
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
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
Journal of Mathematical Cryptology, 2022 Rahman and Shpilrain proposed a Diffie–Hellman style key exchange based on a semidirect product of n×nn\times n-matrices over a finite field. We show that, using public information, an adversary can recover the agreed upon secret key by solving a system ...
Brown Daniel R. L. +2 more
doaj +1 more source
Every Binary Self-Dual Code Arises From Hilbert Symbols
, 2012 In this paper we construct binary self-dual codes using the \'etale cohomology of $\mathbb{Z}/2$ on the spectra of rings of $S$-integers of global fields.
Chinburg, Ted, Zhang, Ying
core +1 more source
BTLE: Atomic swaps with time-lock puzzles
Journal of Mathematical CryptologyWe 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 +3 more
doaj +1 more source
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
Dynamic-FROST: Schnorr threshold signatures with a flexible committee
Journal of Mathematical CryptologyThreshold signatures enable any subgroup of predefined cardinality tt out of a committee of nn participants to generate a valid, aggregated signature.
Cimatti Annalisa +7 more
doaj +1 more source