Results 31 to 40 of about 1,293,597 (281)
Analysis of the Fault Attack ECDLP over Prime Field
In 2000, Biehl et al. proposed a fault-based attack on elliptic curve cryptography. In this paper, we refined the fault attack method. An elliptic curve E is defined over prime field 𝔽p with base point P∈E(𝔽p).
Mingqiang Wang, Tao Zhan
doaj +1 more source
The confinement mechanism proposed earlier by the author is applied to estimate the possible parameters of the confining SU(3)-gluonic field in an $\eta^\prime$-meson.
+16 more
core +1 more source
Prime Field ECDSA Signature Processing for Reconfigurable Embedded Systems
Growing ubiquity and safety relevance of embedded systems strengthen the need to protect their functionality against malicious attacks. Communication and system authentication by digital signature schemes is a major issue in securing such systems.
Benjamin Glas +4 more
doaj +1 more source
Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution
This paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang +5 more
doaj +1 more source
Effective log-free zero density estimates for automorphic $L$-functions and the Sato-Tate conjecture
Let $K/\mathbb{Q}$ be a number field. Let $\pi$ and $\pi^\prime$ be cuspidal automorphic representations of $\mathrm{GL}_d(\mathbb{A}_K)$ and $\mathrm{GL}_{d^\prime}(\mathbb{A}_K)$, and suppose that either both $d$ and $d'$ are at most 2 or at least one ...
Oliver, Robert J. Lemke, Thorner, Jesse
core +1 more source
Explicit decomposition of a rational prime in a cubic field
We give the explicit decomposition of the principal ideal 〈p〉 (p prime) in a cubic field.
Saban Alaca +2 more
doaj +1 more source
A high speed processor for elliptic curve cryptography over NIST prime field
Elliptic curve cryptography (ECC), as one of the public key cryptography systems, has been widely applied to many security applications. It is challenging to implement a scalar multiplication (SM) operation which has the highest computational complexity ...
Xianghong Hu +4 more
doaj +1 more source
Mersenne Primes in Real Quadratic Fields
The concept of Mersenne primes is studied in real quadratic fields of class number 1. Computational results are given. The field $Q(\sqrt{2})$ is studied in detail with a focus on representing Mersenne primes in the form $x^{2}+7y^{2}$. It is also proved that $x$ is divisible by 8 and $y\equiv \pm3\pmod{8}$ generalizing the result of F Lemmermeyer ...
Palimar, Sushma, Shankar, B. R.
openaire +3 more sources
Floquet engineering of tilted and gapped Dirac bandstructure in 1T $$^\prime$$ ′ -MoS $$_2$$ 2
We have developed a rigorous theoretical formalism for Floquet engineering, investigating, and subsequently tailoring most crucial electronic properties of 1T $$^\prime$$ ′ -MoS $$_2$$ 2 by applying an external high-frequency dressing field within the ...
Andrii Iurov +6 more
doaj +1 more source
Antisymmetrization of a Mean Field Calculation of the T-Matrix
The usual definition of the prior(post) interaction $V(V^\prime )$ between projectile and target (resp. ejectile and residual target) being contradictory with full antisymmetrization between nucleons, an explicit antisymmetrization projector ${\cal A ...
A. Ohnishi +22 more
core +1 more source

