Results 11 to 20 of about 696 (69)
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 +4 more
doaj +1 more source
Complete intersections in binomial and lattice ideals [PDF]
, 2013 For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic complete ...
H. Villarreal, Hiram H. López, Rafael
core +1 more source
On the concrete hardness of Learning with Errors
Journal of Mathematical Cryptology, 2015 The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE.
Albrecht Martin R. +2 more
doaj +1 more source
Another look at normal approximations in cryptanalysis
Journal of Mathematical Cryptology, 2016 Statistical analysis of attacks on symmetric ciphers often requires assuming the normal behaviour of a test statistic. Typically such an assumption is made in an asymptotic sense.
Samajder Subhabrata, Sarkar Palash
doaj +1 more source
Privacy-preserving verifiable delegation of polynomial and matrix functions
Journal of Mathematical Cryptology, 2020 Outsourcing computation has gained significant popularity in recent years due to the development of cloud computing and mobile services. In a basic outsourcing model, a client delegates computation of a function f on an input x to a server. There are two
Zhang Liang Feng, Safavi-Naini Reihaneh
doaj +1 more source
On the k-error linear complexity of cyclotomic sequences [PDF]
, 2007 Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant on the cyclotomic classes are determined. This family of sequences includes sequences of discrete logarithms, Legendre sequences and Hall's sextic residue
Hassan, Aly +2 more
core +1 more source
New approach to practical leakage-resilient public-key cryptography
Journal of Mathematical Cryptology, 2020 We present a new approach to construct several leakage-resilient cryptographic primitives, including leakage-resilient public-key encryption (PKE) schemes, authenticated key exchange (AKE) protocols and low-latency key exchange (LLKE) protocols.
Chakraborty Suvradip +2 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
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
Designing Efficient Dyadic Operations for Cryptographic Applications
Journal of Mathematical Cryptology, 2020 Cryptographic primitives from coding theory are some of the most promising candidates for NIST’s Post-Quantum Cryptography Standardization process. In this paper, we introduce a variety of techniques to improve operations on dyadic matrices, a particular
Banegas Gustavo +3 more
doaj +1 more source