Results 21 to 30 of about 105 (87)

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

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

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, Chin Ariana, Kirtland Aaron, Nazarchuk Vladyslav, Plotnick Esther   +4 more
doaj   +1 more source

Establishment of clinical criteria for the diagnosis of adverse food reactions in dogs with atopic dermatitis

Veterinary Dermatology, Volume 35, Issue 4, Page 418-431, August 2024.
Background – Diagnosis of canine adverse food reactions (AFRs) is based on vague criteria, such as ‘>50% improvement’ during elimination diet trial (EDT) followed by ‘deterioration’ during provocation test (PT). Objective – The objective of the study was to use predefined criteria to evaluate response during EDT [i.e., Owner Global Assessment of ...
Evi I. Sofou, Svetlina Aleksandrova, Manolis Chatzis, Elisa Samuel (Badulescu), Manolis N. Saridomichelakis   +4 more
wiley   +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

Dynamic-FROST: Schnorr threshold signatures with a flexible committee

Journal of Mathematical Cryptology
Threshold signatures enable any subgroup of predefined cardinality tt out of a committee of nn participants to generate a valid, aggregated signature.
Cimatti Annalisa, De Sclavis Francesco, Galano Giuseppe, Giammusso Sara, Iezzi Michela, Muci Antonio, Nardelli Matteo, Pedicini Marco   +7 more
doaj   +1 more source

Bounds on the list-decoding radius of reed-solomon codes

, 2003
Techniques are presented for computing upper and lower bounds on the number of errors that can be corrected by list decoders for general block codes and, speci cally, for Reed-Solomon (RS) codes.
Gitit Ruckenstein, Ron M. Roth
core   +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

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

Cryptanalysis of “MAKE”

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., Koblitz Neal, LeGrow Jason T.   +2 more
doaj   +1 more source