Results 21 to 30 of about 213 (104)

Algebraic and quantum attacks on two digital signature schemes

Journal of Mathematical Cryptology, 2023
In this article, we analyze two digital signature schemes, proposed in Moldovyan et al., that use finite noncommutative associative algebras as underlying platforms.
Roman’kov Vitaly, Ushakov Alexander, Shpilrain Vladimir   +2 more
doaj   +1 more source

Linear approaches to resilient aggregation in sensor networks

Journal of Mathematical Cryptology, 2015
A sensor network is a network comprised of many small, wireless, resource-limited nodes that sense data about their environment and report readings to a base station. One technique to conserve power in a sensor network is to aggregate sensor readings hop-
Henry Kevin J., Stinson Douglas R.
doaj   +1 more source

Efficient halving for genus 3 curves over binary fields [PDF]

, 2009
In this article, we deal with fast arithmetic in the Picard group of hyperelliptic curves of genus 3 over binary fields. We investigate both the optimal performance curves, where [h(x)=1] , and the more general curves where the degree of [h(x)] is 1, 2 ...
Birkner, P., Peter Birkner, Thériault, N, Nicolas Thériault, Thériault, N., Birkner, P Peter   +5 more
core   +1 more source

Analysis of a key exchange protocol based on tropical matrix algebra

Journal of Mathematical Cryptology, 2018
In this paper, we consider a two party key-exchange protocol proposed in [D. Grigoriev and V. Shpilrain, Tropical cryptography, Comm. Algebra 43 (2014), 2624–2632, Section 2], which uses tropical matrix algebra as the platform.
Kotov Matvei, Ushakov Alexander
doaj   +1 more source

Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields

Open Mathematics, 2020
In 2006, Hubert, Mauduit and Sárközy extended the notion of binary sequences to n-dimensional binary lattices and introduced the measures of pseudorandomness of binary lattices.
Chen Xiaolin
doaj   +1 more source

Recovering Secrets From Prefix-Dependent Leakage

Journal of Mathematical Cryptology, 2020
We discuss how to recover a secret bitstring given partial information obtained during a computation over that string, assuming the computation is a deterministic algorithm processing the secret bits sequentially.
Ferradi Houda, Géraud Rémi, Guilley Sylvain, Naccache David, Tibouchi Mehdi   +4 more
doaj   +1 more source

Fast hash functions and convolution product

Journal of Mathematical Cryptology, 2014
We propose a new simple and efficient family of hash functions based on matrix-vector multiplications with a competitive software implementation. The hash design combines a hard mathematical problem based on solving a system of linear equations with ...
Omar Sami, Sabri Houssem
doaj   +1 more source

Two-permutation-based hashing with binary mixing

Journal of Mathematical Cryptology, 2015
We consider the generic design of compression functions based on two n-bit permutations and XOR-based mixing functions. It is known that any such function mapping n+α${n+\alpha }$ to α bits, with 1≤α≤n${1\le \alpha \le n}$, can achieve at most min{2α/2 ...
Luykx Atul, Mennink Bart, Preneel Bart, Winnen Laura   +3 more
doaj   +1 more source

A code-based hybrid signcryption scheme

Journal of Mathematical Cryptology, 2023
A key encapsulation mechanism (KEM{\mathsf{KEM}}) that takes as input an arbitrary string, i.e., a tag, is known as tag-KEM{\mathsf{KEM}}, while a scheme that combines signature and encryption is called signcryption.
Klamti Jean Belo, Hasan M. Anwarul
doaj   +1 more source

Revisiting linearly extended discrete functions

Journal of Mathematical Cryptology
The authors introduced a new family of cryptographic schemes in a previous research article, which includes many practical encryption schemes, such as the Feistel family. Given a finite field of order qq, any n>m≥0n\gt m\ge 0, the authors described a new
Gravel Claude, Panario Daniel
doaj   +1 more source