Results 21 to 30 of about 196 (92)

The distribution of quadratic residues and non-residues in the Goldwasser–Micali type of cryptosystem

Journal of Mathematical Cryptology, 2014
We provide unconditional results and conditional ones under the assumption of GRH (Generalized Riemann Hypothesis) on the distribution of quadratic residues and quadratic non-residues in ℤ/Nℤ$\mathbb {Z}/N\mathbb {Z}$, where N=pq$N= pq$ is an RSA modulus
Justus Benjamin
doaj   +1 more source

Exact information ratios for secret sharing on small graphs with girth at least 5

Journal of Mathematical Cryptology, 2019
In a secret-sharing scheme, a piece of information – the secret – is distributed among a finite set of participants in such a way that only some predefined coalitions can recover it.
Harsányi Károly, Ligeti Péter
doaj   +1 more source

Cryptanalysis of an RSA variant with moduli N=prql

Journal of Mathematical Cryptology, 2017
In this paper we study an RSA variant with moduli of the form N=pr⁢ql{N=p^{r}q^{l}} (r>l≥2{r>l\geq 2}). This variant was mentioned by Boneh, Durfee and Howgrave-Graham [2]. Later Lim, Kim, Yie and Lee [11] showed that this variant is much faster than the
Lu Yao, Peng Liqiang, Sarkar Santanu
doaj   +1 more source

An efficient post-quantum KEM from CSIDH

Journal of Mathematical Cryptology, 2022
The SIDH and CSIDH are now the two most well-known post-quantum key exchange protocols from the supersingular isogeny-based cryptography, which have attracted much attention in recent years and served as the building blocks of other supersingular isogeny-
Qi Mingping
doaj   +1 more source

SKENO: Secret key encryption with non-interactive opening

Journal of Mathematical Cryptology, 2015
In this paper, we introduce the notion of secret key encryption with non-interactive opening (SKENO). With SKENO, one can make a non-interactive proof π to show that the decryption result of a ciphertext C under a shared secret key K is indeed plaintext ...
Chen Jiageng, Emura Keita, Miyaji Atsuko
doaj   +1 more source

Provable security against generic attacks on stream ciphers

Journal of Mathematical Cryptology, 2023
Recent lightweight hardware-based stream cipher designs keep an external non-volatile internal state that is not part of the cipher’s hardware module. The purpose of these so-called small-state ciphers is to keep the size of the hardware and the power ...
Moch Alexander
doaj   +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., Player Rachel, Scott Sam   +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

Discretisation and Product Distributions in Ring-LWE

Journal of Mathematical Cryptology, 2020
A statistical framework applicable to Ring-LWE was outlined by Murphy and Player (IACR eprint 2019/452). Its applicability was demonstrated with an analysis of the decryption failure probability for degree-1 and degree-2 ciphertexts in the homomorphic ...
Murphy Sean, Player Rachel
doaj   +1 more source

Generalization of Roos bias in RC4 and some results on key-keystream relations

Journal of Mathematical Cryptology, 2018
RC4 has attracted many cryptologists due to its simple structure. In [9], Paterson, Poettering and Schuldt reported the results of a large scale computation of RC4 biases.
Dey Sabyasachi, Sarkar Santanu
doaj   +1 more source