In this paper, a new algorithm is proposed for finding inverse and determinant of a given matrix in one instance. The algorithm is straightforward in understanding and manual calculations. Computer implementation of the algorithm is extremely simple and is quite efficient in time and memory utilization. The algorithm is supported by an example. The number of multiplication/division performed by...

The IF processing block is by far the most computationally intensive part of wide-band receivers in software radios. From a signal processing point of view, digital filtering is the main task in IF processing. Infinite precision filters require complicated digital circuits due to coefficient multiplication. This paper presents an efficient method to implement pulse shaping filters for GSM recei...

This paper describes a new method to speed up Fp-arithmetic for Barreto-Naehrig (BN) curves. We explore the characteristics of the modulus defined by BN curves and choose curve parameters such that Fp multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a polynomial ring combined with a coefficient reduction phase using a pseudo-Mersenne number. With this a...

purpose: to report a case who had optic disc duplication, a rare congenital disorder characterized by two well-defined discs in one eye. case report: a 19 months-old child presented with unilateral epiphora in the right eye since birthday. the right eye was smaller than the left eye and mild ptosis was apparent. nasolacrimal duct probing was performed under general anesthesia. the examination r...

in this paper, we calculate electron and hole impactionization coefficients in in0.52al0.48as using a monte carlo modelwhich has two valleys and two bands for electrons and holesrespectively. also, we calculate multiplication factor for electronand hole initiated multiplication regimes and breakdown voltagein in0.52al0.48as pin avalanche photodiodes. to validate themodel, we compare our simulat...

The bottleneck in the proving algorithm of most elliptic-curve-based SNARK proof systems is Multi-Scalar-Multiplication (MSM) algorithm. In this paper we give an overview a variant Pippenger MSM together with set optimizations tailored for curves that admit twisted Edwards form. We prove case SNARK-friendly chains and cycles elliptic curves, which are useful recursive constructions. Our contrib...

let $r$ be a commutative ring and let $m$ be an $r$-module. we define the small intersection graph $g(m)$ of $m$ with all non-small proper submodules of $m$ as vertices and two distinct vertices $n, k$ are adjacent if and only if $ncap k$ is a non-small submodule of $m$. in this article, we investigate the interplay between the graph-theoretic properties of $g(m)$ and algebraic properties of $m...

Kernel of the symmetric block ciphering methods presented here is the coupling of XOR operations and of invertible substitution tables S with all possible 256**t byte groups (with t=1, 2, 3, ... Bytes, fixed at the beginning) being derived from keys: K(block) := S(S(block) ⊗ Eo) ⊗ Eu with-Eo upper and Eu lower triangular (byte-group-)matrix with (byte-block-length/t)**2 values, value 1 at all n...