Results 31 to 40 of about 856 (103)

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

The ElGamal cryptosystem over circulant matrices [PDF]

, 2011
In this paper we study extensively the discrete logarithm problem in the group of non-singular circulant matrices. The emphasis of this study was to find the exact parameters for the group of circulant matrices for a secure implementation.
Mahalanobis, Ayan
core   +3 more sources

Statistics for fixed points of the self-power map

, 2014
The map x -> x^x modulo p is related to a variation of the digital signature scheme in a similar way to the discrete exponentiation map, but it has received much less study.
Friedrichsen, Matthew, Holden, Joshua
core   +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

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

Z2Z4-Additive Perdect Codes in Steganography [PDF]

, 2011
Steganography is an information hiding application which aims to hide secret data imperceptibly into a cover object. In this paper, we describe a novel coding method based on Z2Z4-additive codes in which data is embedded by distorting each cover ...
Rifà Coma, Josep, Rifà Pous, Helena, Ronquillo, Lorena   +2 more
core  

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

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

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