Results 31 to 40 of about 169,709 (230)
, 2017 The Discrete Logarithm Problem (DLP) is one of the most used mathematical problems in asymmetric cryptography design, the other one being the integer factorization. It is intrinsically related to the Diffie-Hellman problem (DHP). DLP can be stated in various groups. It must be hard in well-chosen groups, so that secure-enough cryptosystems can be built.
Guillevic, Aurore, Morain, François
openaire +2 more sources
Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
Cryptography, 2018 In 2008, Doliskani et al. proposed an ElGamal-style encryption scheme using the symmetric group Sn as mathematical platform. In 2012, an improvement of the cryptosystem’s memory requirements was suggested by Othman. The proposal by Doliskani et al.
María Isabel González Vasco +2 more
doaj +1 more source
Multilayer neural networks with extensively many hidden units [PDF]
, 2001 The information processing abilities of a multilayer neural network with a number of hidden units scaling as the input dimension are studied using statistical mechanics methods. The mapping from the input layer to the hidden units is performed by general
A. Bethge +26 more
core +1 more source
The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
Journal of Mathematical Cryptology, 2010 The paper provides a cryptanalysis of the AAβ-cryptosystem recently proposed by Ariffin and Abu. The scheme is in essence a key agreement scheme whose security is based on a discrete logarithm problem in the infinite (additive) group ℝ/ℤ (the reals ...
Blackburn Simon R.
doaj +1 more source
Comparative Study of Digital Signature Standards Based on Discrete Logarithm [PDF]
Jisuanji gongcheng, 2016 As Chinese state encryption administration is seeking the next generation of Digital Signature Standard(DSS),this paper analyzes and compares seven DSS listed in ISO/IEC 14888-3 and SM2 which are based on Discrete Logarithm Problem(DLP) or Elliptic Curve
FENG Zeyu,GONG Boru,ZHAO Yunlei
doaj +1 more source
Recognising the small Ree groups in their natural representations
, 2014 We present Las Vegas algorithms for constructive recognition and constructive membership testing of the Ree groups 2G_2(q) = Ree(q), where q = 3^{2m + 1} for some m > 0, in their natural representations of degree 7. The input is a generating set X. The
Babai +36 more
core +1 more source
Finite fields and cryptology [PDF]
Computer Science Journal of Moldova, 2003 The problem of a computationally feasible method of finding the discrete logarithm in a (large) finite field is discussed, presenting the main algorithms in this direction.
Ennio Cortellini
doaj
Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
Journal of Mathematical Cryptology, 2014 We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group 𝐆$\mathbf {G}$. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the ...
Bos Joppe W. +2 more
doaj +1 more source
Almost Sure Invariance Principle For Nonuniformly Hyperbolic Systems [PDF]
, 2005 We prove an almost sure invariance principle that is valid for general classes of nonuniformly expanding and nonuniformly hyperbolic dynamical systems. Discrete time systems and flows are covered by this result.
Melbourne, Ian, Nicol, Matthew
core +3 more sources
Individual discrete logarithm with sublattice reduction
Designs, Codes and Cryptography, 2023 Designs, Codes and Cryptography ...
Al Aswad, Haetham, Pierrot, Cécile
openaire +4 more sources