Results 51 to 60 of about 15,305 (259)
Advanced Engineering Materials, EarlyView.In this experimental study, the mechanical properties of additively manufactured Ti‐6Al‐4V lattice structures of different geometries are characterized using compression, four point bending and fatigue testing. While TPMS designs show superior fatigue resistance, SplitP and Honeycomb lattice structures combine high stiffness and strength. The resulting
Klaus Burkart +3 more
wiley +1 more source
The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
Journal of Mathematical Cryptology, 2010 Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group.
Shokrieh Farbod
doaj +1 more source
The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
IEEE Transactions on Quantum Engineering, 2022 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
Advanced Engineering Materials, EarlyView.High‐temperature interactions between low‐sulfur Al‐killed Mn–B steel and MgO–C refractories (0 and 50 wt% recyclates) are studied via finger immersion tests (1600 °C). Surface‐active elements influence infiltration. MgO/CaS layer forms, along with spinel and calcium silicate.
Matheus Roberto Bellé +5 more
wiley +1 more source
On the Discrete Logarithmic Minkowski Problem [PDF]
International Mathematics Research Notices, 2015 If \(K\subset{\mathbb R}^n\) is a convex body (compact and convex set with non-empty interior) containing the origin as an interior point, the cone-volume measure of \(K\) is the Borel measure on the unit sphere \(S^{n-1}\) defined by \[ V_K(\omega)=\frac{1}{n}\int_{x\in\nu_K^{-1}(\omega)}x\cdot\nu_K(x)d\mathcal{H}^{n-1}(x), \quad \text{for each Borel }
Böröczky, Károly (Ifj.) +2 more
openaire +2 more sources
Electrical Conductivities of Conductors, Semiconductors, and Their Mixtures at Elevated Temperatures
Advanced Engineering Materials, EarlyView.This article presents a comprehensive review of temperature‐dependent electrical conductivity data for multiple material classes at elevated temperatures, highlighting a persistent conductivity gap between metals and semiconductors in the range of 102$\left(10\right)^{2}$– 107$\left(10\right)^{7}$ S/m. Metal–ceramic irregular metamaterials are proposed
Valentina Torres Nieto, Marcia A. Cooper
wiley +1 more source
Implications of the Arithmetic Ratio of Prime Numbers for RSA Security
International Journal of Applied Mathematics and Computer Science, 2023 The most commonly used public key cryptographic algorithms are based on the difficulty in solving mathematical problems such as the integer factorization problem (IFP), the discrete logarithm problem (DLP) and the elliptic curve discrete logarithm ...
Ivanov Andrey, Stoianov Nikolai
doaj +1 more source
Advanced Functional Materials, EarlyView.Controlled laser‐drilling of embedded HfO2 membranes creates three layer nanopores with Gaussian‐shaped cavities sculptured in the supporting layers. These embedded solid‐state nanopores slow DNA translocation by 12‐fold compared to SiNx pores, enabling high‐resolution, label‐free detection of short DNAs, RNAs, and proteins.
Jostine Joby +4 more
wiley +1 more source
Security of the cryptosystems based on ergodic matrices
Tongxin xuebao, 2015 The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved ...
Hua-wei HUANG +3 more
doaj +2 more sources
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
Journal of Mathematical Cryptology, 2009 Biggs has recently proposed the critical group of a certain class of finite graphs as a platform group for cryptosystems relying on the difficulty of the discrete log problem. The paper uses techniques from the theory of Picard groups on finite graphs to
Blackburn Simon R.
doaj +1 more source