Piezoelectric A15B16C17 Compounds and Their Nanocomposites for Energy Harvesting and Sensors: A Review

Interest in pyroelectrics and piezoelectrics has increased worldwide on account of their unique properties. Applications based on these phenomena include piezo- and pyroelectric nanogenerators, piezoelectric sensors, and piezocatalysis. One of the most interesting materials used in this growing field are A15B16C17 nanowires, an example of which is SbSI. The latter has an electromechanical coupling coefficient of 0.8, a piezoelectric module of 2000 pC/N, and a pyroelectric coefficient of 12 × 10−3 C/m2K. In this review, we examine the production and properties of these nanowires and their composites, such as PAN/SbSI and PVDF/SbSI. The generated electrical response from 11 different structures under various excitations, such as an impact or a pressure shock, are presented. It is shown, for example, that the PVDF/SbSI and PAN/SbSI composites have well-arranged nanowires, the orientation of which greatly affects the value of its output power. The power density for all the nanogenerators based upon A15B16C17 nanowires (and their composites) are recalculated by use of the same key equation. This enables an accurate comparison of the efficiency of all the configurations. The piezo- and photocatalytic properties of SbSI nanowires are also presented; their excellent ability is shown by the high reaction kinetic rate constant (7.6 min−1).

Exploiting the security of N = prqs through approximation of ϕ(N)

This paper reports new techniques that exploit the security of the prime power moduli [Formula: see text] using continued fraction method. Our study shows that the key equation [Formula: see text] can be exploited using [Formula: see text] as good approximation of [Formula: see text]. This enables us to get [Formula: see text] from the convergents of the continued fractions expansion of [Formula: see text] where the bound of the private exponent is [Formula: see text] which leads to the polynomial time factorization of the moduli [Formula: see text]. We further report the polynomial time attacks that can break the security of the generalized prime power moduli [Formula: see text] using generalized system of equation of the form [Formula: see text] and [Formula: see text] by applying simultaneous Diophantine approximations and LLL algorithm techniques where [Formula: see text] and [Formula: see text].

Strategic Way of Factoring Modulus ``\(N = p^r q\)

Cryptography is fundamental to the provision of a wider notion of information security. Electronic information can easily be transmitted and stored in relatively insecure environments. This research was present to factor the prime power modulus \(N = p^r q\) for \(r \geq 2\) using the RSA key equation, if \(\frac{y}{x}\) is a convergents of the continued fractions expansions of \(\frac{e}{N - \left(2^{\frac{2r+1}{r+1}} N^{\frac{r}{r+1}} - 2^{\frac{r-1}{r+1}} N^{\frac{r-1}{r+1}}\right)}\). We furthered our analysis on \(n\) prime power moduli \(N_i = p_i^r q_i\) by transforming the generalized key equations into Simultaneous Diophantine approximations and using the LLL algorithm on \(n\) prime power public keys \((N_i,e_i)\) we were able to factorize the \(n\) prime power moduli \(N_i = p_i^r q_i\), for \(i = 1,....,n\) simultaneously in polynomial time.

BCH CODES DECODER BASED ON EUCLID ALGORITHM

In the process of algebraic decoding of BCH codes over the field GF(q) with the word length n = qm-1, correcting t errors, both in the time and frequency domains, it is necessary to find the error locator polynomial ?(x) as the least polynomial for which the key equation. Berlekamp proposed a simple iterative scheme, which was called the Berlekamp-Messi algorithm, and is currently used in most practical applications. Comparative statistical tests of the proposed decoder and decoder using the Berlikamp-Messi algorithm showed that they differ slightly in decoding speed. The proposed algorithm is implemented in the environment in Turbo Pascal and can be used for the entire family of BCH codes by replacing the primitive Galois polynomial.