Results 11 to 20 of about 774 (86)

Multiple differential-zero correlation linear cryptanalysis of reduced-round CAST-256

Journal of Mathematical Cryptology, 2017
CAST-256 (or CAST6) is a symmetric-key block cipher published in June 1998. It was submitted as a candidate for Advanced Encryption Standard (AES). In this paper, we will propose a new chosen text attack, the multiple differential-zero correlation linear
Hadian Dehkordi Massoud, Taghizadeh Roghayeh   +1 more
doaj   +1 more source

Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem

Journal of Mathematical Cryptology, 2020
We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus ...
Huang Ming-Deh, Kosters Michiel, Petit Christophe, Yeo Sze Ling, Yun Yang   +4 more
doaj   +1 more source

PotLLL: A Polynomial Time Version of LLL With Deep Insertions [PDF]

, 2012
Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm.
Fontein, Felix, Schneider, Michael, Wagner, Urs   +2 more
core   +5 more sources

Classes of weak Dembowski–Ostrom polynomials for multivariate quadratic cryptosystems

Journal of Mathematical Cryptology, 2015
T. Harayama and D. K. Friesen [J. Math. Cryptol. 1 (2007), 79–104] proposed the linearized binomial attack for multivariate quadratic cryptosystems and introduced weak Dembowski–Ostrom (DO) polynomials in this framework over the finite field 𝔽2.
Alam Bilal, Özbudak Ferruh, Yayla Oğuz
doaj   +1 more source

Quantum computation of discrete logarithms in semigroups

Journal of Mathematical Cryptology, 2014
We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor's algorithms for period finding and the discrete logarithm problem as subroutines.
Childs Andrew M., Ivanyos Gábor
doaj   +1 more source

(In)Security of Ring-LWE Under Partial Key Exposure

Journal of Mathematical Cryptology, 2020
We initiate the study of partial key exposure in Ring-LWE (RLWE)-based cryptosystems. Specifically, we (1) Introduce the search and decision Leaky R-LWE assumptions (Leaky R-SLWE, Leaky R-DLWE), to formalize the hardness of search/decision RLWE under ...
Dachman-Soled Dana, Gong Huijing, Kulkarni Mukul, Shahverdi Aria   +3 more
doaj   +1 more source

The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives [PDF]

, 2017
In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.Comment: 8 ...
Gadiyar, H. Gopalakrishna, Padma, R.
core   +3 more sources

Factoring with Hints

Journal of Mathematical Cryptology, 2020
We introduce a new approach to (deterministic) integer factorisation, which could be described in the cryptographically fashionable term of “factoring with hints”: we prove that, for any ϵ > 0, given the knowledge of the factorisations of O(N1/3+ϵ) terms
Sica Francesco
doaj   +1 more source

Plactic key agreement (insecure?)

Journal of Mathematical Cryptology, 2023
Plactic key agreement is a new type of cryptographic key agreement that uses Knuth’s multiplication of semistandard tableaux from combinatorial algebra.
Brown Daniel R. L.
doaj   +1 more source

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

Journal of Mathematical Cryptology, 2015
We provide three statistical laws concerning the limit distribution of quadratic residues and quadratic non-residues in ℤ/Nℤ${\mathbb {Z}/N\mathbb {Z}}$, where N=pq${{N= pq}}$ is an RSA modulus used in the Goldwasser–Micali cryptosystem.
Justus Benjamin
doaj   +1 more source