Results 11 to 20 of about 213 (104)
Bent and generalized bent Boolean functions [PDF]
, 2012 Mathematics Subject Classification (2000) 94A60 · 94C10 · 06E30The article of record as published may be found at http://dx.doi.org/10.1007/s10623-012-9622-5;In this paper, we investigate the properties of generalized bent functions defined on Zn2 with ...
Thor Martinsen +7 more
core +3 more sources
Comparison Between Algebraic Cryptanalysis on DES and NTRU
, 2023 Algebraic cryptanalysis is a cryptanalysis method that aims to exploit the algebraic structure of an encryption algorithm to obtain the secret key. Algebraic cryptanalysis becomes interesting because it uses a small amount of known plaintext, which in ...
Kiki Ariyanti Sugeng, Fadila Paradise
core +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 +4 more
doaj +1 more source
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
Compartmented Threshold RSA Based on the Chinese Remainder Theorem [PDF]
, 2008 In this paper we combine the compartmented secret sharing schemes based on the Chinese remainder theorem with the RSA scheme in order to obtain, as a novelty, a dedicated solution for compartmented threshold decryption or compartmented threshold digital ...
Stefan Ciobaca +2 more
core +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 +3 more
doaj +1 more source
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
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