Results 51 to 60 of about 1,067,462 (345)
The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing ...
YOSHINORI AONO+6 more
doaj +1 more source
Computing Small Discrete Logarithms Faster [PDF]
Computations of small discrete logarithms are feasible even in "secure" groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh–Goh–Nissim degree-2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption.
Tanja Lange+2 more
openaire +3 more sources
On the Discrete Logarithmic Minkowski Problem [PDF]
A new sufficient condition for the existence of a solution for the logarithmic Minkowski problem is established. This new condition contains the one established by Zhu [70] and the discrete case established by Boroczky et al. [7] as two important special cases. © The Author(s) 2015. Published by Oxford University Press. All rights reserved.
Guangxian Zhu+3 more
openaire +2 more sources
Transcriptome‐wide analysis of circRNA and RBP profiles and their molecular relevance for GBM
CircRNAs are differentially expressed in glioblastoma primary tumors and might serve as therapeutic targets and diagnostic markers. The investigation of circRNA and RNA‐binding proteins (RBPs) interactions shows that distinct RBPs play a role in circRNA biogenesis and function.
Julia Latowska‐Łysiak+14 more
wiley +1 more source
Abstract Purpose The aim of this work was to report on the optimization, commissioning, and validation of a beam model using a commercial independent dose verification software RadCalc version 7.2 (Lifeline Software Inc, Tyler, TX, USA), along with 4 years of experience employing RadCalc for offline and online monitor unit (MU) verification on the ...
Urszula Jelen+3 more
wiley +1 more source
This 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 +1 more source
Mechanisms of De‐icing by Surface Rayleigh and Plate Lamb Acoustic Waves
Ice accretion impacts daily life, renewable energy generation, maintenance, and security in industries and aeronautics. Acoustic waves (AW) are a promising method for ice removal, although de‐icing mechanisms require further investigation to optimize energy efficiency.
Shilpi Pandey+15 more
wiley +1 more source
A deterministic algorithm for the discrete logarithm problem in a semigroup
The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of O(NlogN)O\left(\sqrt{N}\log N) and a space complexity of O(N)O\left ...
Tinani Simran, Rosenthal Joachim
doaj +1 more source
A new approach to the discrete logarithm problem with auxiliary inputs
The aim of the discrete logarithm problem with auxiliary inputs is to solve for α , given the elements g, g α , . . . , g α d of a cyclic group G = (cid:104) g (cid:105) , of prime order p . The best-known algorithm, proposed by Cheon in 2006, solves for
J. Cheon, Taechan Kim
semanticscholar +1 more source
Mesoporous Silica Microspheres by Super‐Fast Alkaline Etching of Micrometer‐Sized Stöber Particles
Microscale silica particles are prepared along with a modified, scalable Stöber synthesis using the continuous addition of tetraethoxy silane to an ethanolic solution of ammonia with KCl. Etching with hydroxide ions at 95 °C gave porous analogs within minutes. Monodisperse particles are isolable in high yield after precipitation in ethanol.
Adrian Vaghar+2 more
wiley +1 more source