Results 11 to 20 of about 943,112 (315)
On the k-Error Linear Complexity of Binary Sequences Derived from the Discrete Logarithm in Finite Fields [PDF]
Complexity, 2019 Let Fq be the finite field with q=pr elements, where p is an odd prime. For the ordered elements ξ0,ξ1,…,ξq-1∈Fq, the binary sequence σ=(σ0,σ1,…,σq-1) with period q is defined over the finite field F2={0,1} as follows: σn=0, if n=0, (1-χ(ξn))/2, if ...
Zhixiong Chen, Qiuyan Wang
doaj +8 more sources
Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained [PDF]
Entropy, 2022 In this paper, we consider the optimization of the quantum circuit for discrete logarithm of binary elliptic curves under a constrained connectivity, focusing on the resource expenditure and the optimal design for quantum operations such as the addition,
Jianmei Liu +5 more
doaj +3 more sources
Computation of a 30750-bit binary field discrete logarithm [PDF]
Mathematics of Computation, 2021 This paper reports on the computation of a discrete logarithm in the finite field F 2 30750 \mathbb {F}_{2^{30750}} , breaking by a large margin the previous record, which was set in January 2014 by a computation in
Robert Granger +4 more
semanticscholar +7 more sources
Quantum algorithm for solving binary hyperelliptic curve discrete logarithm problem [PDF]
CybersecurityIt is well-established that Shor’s algorithm can solve the discrete logarithm problem (DLP) in polynomial time. The hyperelliptic curve DLP (HCDLP) of genus 2 has found widespread industrial applications and remains an active research domain.
Yan Huang +4 more
doaj +3 more sources
Binary Logarithm Similarity Measure with Roughness Approximation
Journal of Mathematics and Computing Science, 2023 Roughness measures for uncertainty data occur with less consideration since the data involve indeterminacy and inconsistency. The indeterminacy plus inconsistency can be solved by a rough neutrosophic set with roughness approximation. Therefore, a binary logarithm similarity measure for a rough neutrosophic set with roughness approximation was proposed
Suriana Alias +5 more
semanticscholar +4 more sources
Hybrid Binary Logarithm Similarity Measure for MAGDM Problems under SVNS Assessments [PDF]
Neutrosophic Sets and Systems, 2018 Single valued neutrosophic set is an important mathematical tool for tackling uncertainty in scientific and engineering problems because it can handle situation involving indeterminacy.
Kalyan Mondal +2 more
doaj +3 more sources
Binary sequences and lattices constructed by discrete logarithms
AIMS Mathematics, 2022 In 1997, Mauduit and Sárközy first introduced the measures of pseudorandomness for binary sequences. Since then, many pseudorandom binary sequences have been constructed and studied. In particular, Gyarmati presented a large family of pseudorandom binary
Yuchan Qi, Huaning Liu
doaj +3 more sources
Genetic improvement of data gives binary logarithm from sqrt [PDF]
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019 Automated search in the form of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), plus manual code changes, transforms 512 Newton-Raphson floating point start numbers from an open source GNU C library, glibc, table driven square root function to create a new bespoke custom mathematical implementation of double precision binary logarithm ...
William B. Langdon, Justyna Petke
semanticscholar +3 more sources
A discrete logarithm-based approach to compute low-weight multiples of binary polynomials [PDF]
Finite Fields Their Appl., 2016 Being able to compute efficiently a low-weight multiple of a given binary polynomial is often a key ingredient of correlation attacks to LFSR-based stream ciphers. The best known general purpose algorithm is based on the generalized birthday problem.
Pietro Peterlongo +2 more
core +6 more sources
Binary Division Attack for Elliptic Curve Discrete Logarithm Problem
Transactions on Networks and Communications, 2014 Elliptic curve cryptography (ECC) is an approach to public key cryptography (PKC) that is based on algebraic operations with elliptic curves defined over finite fields. Security of elliptic curve cryptography is based on the hardness of the elliptic curve discrete logarithm problem (ECDLP).
Boris S. Verkhovsky, Yuriy Polyakov
semanticscholar +4 more sources