Results 21 to 30 of about 943,112 (315)
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
+6 more sources
Efficient architectures for computation of binary logarithm [PDF]
2010 IEEE Asia Pacific Conference on Circuits and Systems, 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
+5 more sources
Statistical Analysis of Binary Functional Graphs of the Discrete Logarithm [PDF]
, 2016 15 pages, 4 figures; Senior Thesis, Rose-Hulman Institute of ...
Mitchell Orzech
openalex +3 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 +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
Concrete quantum cryptanalysis of binary elliptic curves
Transactions on Cryptographic Hardware and Embedded Systems, 2020 This paper analyzes and optimizes quantum circuits for computing discrete logarithms on binary elliptic curves, including reversible circuits for fixed-base-point scalar multiplication and the full stack of relevant subroutines.
Gustavo Banegas +3 more
doaj +4 more sources
Quantum Resource Estimates for Computing Binary Elliptic Curve Discrete Logarithms
IEEE Transactions on Quantum EngineeringClose to published ...
Michael Garn, Angus Kan
openalex +3 more sources
, 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
Meta-implementation of vectorized logarithm function in binary floating-point arithmetic
IEEE International Conference on Application-Specific Systems, Architectures, and Processors, 2018 Besides scalar instructions, modern micro-architectures also provide support for vector instructions. They enable to treat packed inputs (typically 4 or 8) in a single instruction.
Hugues de Lassus Saint-Geniès +2 more
openalex +3 more sources