Concrete quantum cryptanalysis of binary elliptic curves
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
Statistical Analysis of Binary Functional Graphs of the Discrete Logarithm
15 pages, 4 figures; Senior Thesis, Rose-Hulman Institute of ...
Mitchell Orzech
openalex +4 more sources
A Unified Hardware Design for Multiplication, Division, and Square Roots Using Binary Logarithms
Multiplication, division, and square root operations introduce significant challenges in digital signal processing (DSP) systems, traditionally requiring multiple operations that increase execution time and hardware complexity.
Dat Ngo, Siyeon Han, Bongsoon Kang
openalex +2 more sources
Pattern recognition applications involve extensive arithmetic operations, including additions, multiplications, and divisions. When implemented on resource-constrained edge devices, these operations demand dedicated hardware, with division being the most
Dat Ngo+3 more
openalex +2 more sources
Normal-phase high performance liquid chromatography of estradiol derivatives on amino- and diol-columns [PDF]
The retention behavior of estradiol derivatives was studied by HPLC on chemically bonded polar stationary phases: commercially available amino and diol- columns, as a function of the heptane-propan-1-ol as the mobile phase, when the volume fraction of ...
Ačanski Marijana M.
doaj +3 more sources
New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm [PDF]
In the previous research on solving the elliptic curve discrete logarithm problem, quantum resources were concretely estimated. In Banegas et al. (IACR Trans Cryptogr Hardw Embed Syst 2021(1):451–472, 2020. https://doi.org/10.46586/tches.v2021.i1.451-472
Hyeon-Jin Kim, Seokhie Hong
semanticscholar +1 more source
Upper bounds on the numbers of binary plateaued and bent functions [PDF]
The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity.
V. Potapov
semanticscholar +1 more source
Logarithmic tail contributions to the energy function of circular compact binaries [PDF]
17 pages, 1 figure. 2 paragraphs added to sec.
Luc Blanchet+3 more
openaire +3 more sources
Features of digital signal processing algorithms using Galois fields GF(2n+1).
An alternating representation of integers in binary form is proposed, in which the numbers -1 and +1 are used instead of zeros and ones. It is shown that such a representation creates considerable convenience for multiplication numbers modulo p = 2n+1 ...
Ibragim E Suleimenov+2 more
doaj +1 more source
Retained Earnings, and Book-to-market in the Cross Section of Expected Returns in Tehran Stock Exchange Market [PDF]
The book-to-market ratio is known as an anomaly variable in the financial literature. This variable has a high explanatory power in predicting the returns of companies in different capital markets across world; But understanding why it has the power to ...
Gholam Reza Keshavarz Haddad+1 more
doaj +1 more source