Results 11 to 20 of about 856 (103)
Enhancing Goldreich, Goldwasser and Halevi’s scheme with intersecting lattices
Journal of Mathematical Cryptology, 2019 We present a technique to enhance the security of the Goldreich, Goldwasser and Halevi (GGH) scheme. The security of GGH has practically been broken by lattice reduction techniques.
Sipasseuth Arnaud +2 more
doaj +1 more source
MRHS solver based on linear algebra and exhaustive search
Journal of Mathematical Cryptology, 2018 We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks.
Raddum Håvard, Zajac Pavol
doaj +1 more source
Remarks on a cyclotomic sequence [PDF]
, 2008 We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al. (IEEE Trans Inforem Theory 51: 1849-1853, 2005).
Meidl, Wilfried
core +2 more sources
Using Inclusion / Exclusion to find Bent and Balanced Monomial Rotation Symmetric Functions
Journal of Mathematical Cryptology, 2021 There are many cryptographic applications of Boolean functions. Recently, research has been done on monomial rotation symmetric (MRS) functions which have useful cryptographic properties.
Reid Elizabeth M.
doaj +1 more source
On a class of strongly asymmetric PKA algorithms
Journal of Mathematical Cryptology, 2015 In the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka ...
Accardi Luigi, Regoli Massimo
doaj +1 more source
Periodic Structure of the Exponential Pseudorandom Number Generator [PDF]
, 2013 We investigate the periodic structure of the exponential pseudorandom number generator obtained from the map $x\mapsto g^x\pmod p$ that acts on the set $\{1, \ldots, p-1\}$
Kaszian, Jonas +2 more
core +1 more source
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
Journal of Mathematical Cryptology, 2021 We generalize our earlier works on computing short discrete logarithms with tradeoffs, and bridge them with Seifert's work on computing orders with tradeoffs, and with Shor's groundbreaking works on computing orders and general discrete logarithms.
Ekerå Martin
doaj +1 more source
Indifferentiability security of the fast wide pipe hash: Breaking the birthday barrier
Journal of Mathematical Cryptology, 2016 A hash function secure in the indifferentiability framework (TCC 2004) is able to resist all meaningful generic attacks. Such hash functions also play a crucial role in establishing the security of protocols that use them as random functions.
Moody Dustin +2 more
doaj +1 more source
INVERSIVE CONGRUENTIAL GENERATOR WITH A VARIABLE SHIFT OF PSEUDORANDOM POINTS OVER THE COMPLEX PLANE
, 2015 Consider the generator of pseudorandom points on unit square produced by the inversive congruential recursion over the ring of Gaussian integers. Study the exponential sums on sequences of these points.
T. T. Vinh
semanticscholar +1 more source
Analysis of a certain polycyclic-group-based cryptosystem
Journal of Mathematical Cryptology, 2015 We investigate security properties of the Anshel–Anshel–Goldfeld commutator key-establishment protocol [Math. Res. Lett. 6 (1999), 287–291] used with certain polycyclic groups described by Eick and Kahrobaei [http://arxiv.org/abs/math.GR/0411077].
Kotov Matvei, Ushakov Alexander
doaj +1 more source