Results 21 to 30 of about 68 (58)
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
BTLE: Atomic swaps with time-lock puzzles
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 +3 more
doaj +1 more source
On the supersingular GPST attack
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
Threshold 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
On the quantum security of high-dimensional RSA protocol
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 +3 more
doaj +1 more source
Time-memory trade-offs for index calculus in genus 3
In this paper, we present a variant of Diem's O˜(q)${\widetilde{O}(q)}$ index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field 𝔽q.
Laine Kim, Lauter Kristin
doaj +1 more source
On Codes Over R and its Bounds of Some kind of Block Repetition Codes in R
This correspondence determines the lower and upper bounds of the covering radius in some kind of block repetition codes over the finite ring R=Z_2 Z_*, where Z_*=Z_2+vZ_2+v^2 Z_2, v^3=v.
P Chella Pandian
doaj +1 more source
Elliptic curve and k-Fibonacci-like sequence
In this paper, we will introduce a modified k-Fibonacci-like sequence defined on an elliptic curve and prove Binet’s formula for this sequence. Moreover, we give a new encryption scheme using this sequence.
Zakariae Cheddour +2 more
doaj +1 more source
A family of ring-based cryptosystems, including the multilinear maps of Garg, Gentry and Halevi [Candidate multilinear maps from ideal lattices, Advances in Cryptology—EUROCRYPT 2013, Lecture Notes in Comput. Sci.
Biasse Jean-François, Song Fang
doaj +1 more source
Predicate signatures from pair encodings via dual system proof technique
Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings.
Nandi Mridul, Pandit Tapas
doaj +1 more source

