Results 51 to 60 of about 207 (105)
, 1994 This paper considers true broadcast systems for the secure communication of session keys. These are schemes that provide for parallel rather than serial construction of broadcast messages, while avoiding selective broadcasting.
Danny Krizanc +3 more
core
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 +3 more
doaj +1 more source
Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus
, 1997 The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system.
Fachbereich Informatik +4 more
core
Revocable policy-based chameleon hash using lattices
Journal of Mathematical CryptologyA chameleon hash function is a type of hash function that involves a trapdoor to help find collisions, i.e., it allows the rewriting of a message without modifying the hash.
Klamti Jean Belo, Hasan Mohammed Anwarul
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
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
Linear approaches to resilient aggregation in sensor networks
Journal of Mathematical Cryptology, 2015 A sensor network is a network comprised of many small, wireless, resource-limited nodes that sense data about their environment and report readings to a base station. One technique to conserve power in a sensor network is to aggregate sensor readings hop-
Henry Kevin J., Stinson Douglas R.
doaj +1 more source
Analysis of a key exchange protocol based on tropical matrix algebra
Journal of Mathematical Cryptology, 2018 In this paper, we consider a two party key-exchange protocol proposed in [D. Grigoriev and V. Shpilrain, Tropical cryptography, Comm. Algebra 43 (2014), 2624–2632, Section 2], which uses tropical matrix algebra as the platform.
Kotov Matvei, Ushakov Alexander
doaj +1 more source