Results 11 to 20 of about 796,772 (273)
A Study of General Attacks on Elliptic Curve Discrete Logarithm Problem Over Prime Field and Binary Field [PDF]
, 2017 Abstract — This paper begins by describing basic properties of finite field and elliptic curve cryptography over prime field and binary field. Then we discuss the discrete logarithm problem for elliptic curves and its properties.
Tun Myat Aung, Ni Ni Hla
semanticscholar +5 more sources
Of Logarithms, Binary Orbits, and Self-Replicating Distributions [PDF]
Publications of the Astronomical Society of the Pacific, 1996 Stellar binary orbital periods and semi-major axes appear to both be distributed in much the same smooth and nearly scale-free form: the probability density funcations of both are monotonically decreasing with increasing period (semi-major axis) and approximately proportional to P-1 (a-1). The impression that the binary period distribution has a single
William D. Heacox
openalex +3 more sources
Efficient architectures for computation of binary logarithm [PDF]
, 2014 Logarithmic Number System (LNS) is often used in digital signal processing to simplify complex arithmetic operations. LNS requires data to be converted into the logarithmic domain, i.e., logarithmic conversion. The thesis studies the VLSI architectures for logarithmic conversion.
Joshua Yung Lih Low
openalex +3 more sources
Binary de Bruijn Sequences via Zech's Logarithms [PDF]
SN Computer Science, 2017 The focus of this work is to show how to combine Zech's logarithms and each of the cycle joining and cross-join pairing methods to construct binary de Bruijn sequences of any order. A basic implementation is supplied as a proof-of-concept. The cycles, in the cycle joining method, are typically generated by a linear feedback shift register.
Zuling Chang +5 more
openalex +4 more sources
The specifics of the Galois field GF(257) and its use for digital signal processing [PDF]
Scientific ReportsAn algorithm of digital logarithm calculation for the Galois field $$GF(257)$$ G F ( 257 ) is proposed. It is shown that this field is coupled with one of the most important existing standards that uses a digital representation of the signal through 256 ...
Akhat Bakirov +4 more
doaj +2 more sources
Journal of Telecommunications and Information TechnologyThis paper investigates how to reduce the elliptic curve discrete logarithm problem over prime fields to the quadratic unconstrained binary optimization (QUBO) problem in order to obtain as few logical qubits as possible. In the best case scenario, if n
Michał Wroński +3 more
doaj +2 more sources
Quantum Binary Field Multiplication with Optimized Toffoli Depth and Extension to Quantum Inversion
Sensors, 2023 The Shor’s algorithm can find solutions to the discrete logarithm problem on binary elliptic curves in polynomial time. A major challenge in implementing Shor’s algorithm is the overhead of representing and performing arithmetic on binary elliptic curves
Kyungbae Jang +5 more
doaj +2 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 +4 more sources
IEEE Access, 2022 Attribute-based blind signature is used to realize the blind signature of messages by multiple people, and it is suitable for electronic payment services in the cloud.
Rui Ma, Linyue Du
doaj +2 more sources
Decision Trees for Binary Subword-Closed Languages [PDF]
Entropy, 2023 In this paper, we study arbitrary subword-closed languages over the alphabet {0,1} (binary subword-closed languages). For the set of words L(n) of the length n belonging to a binary subword-closed language L, we investigate the depth of the decision ...
Mikhail Moshkov
doaj +2 more sources