Nowadays, RSA is the well-known cryptosystem which supports most of electronic commercial communications. RSA is working on the base of multiplication of two prime numbers. Currently different kinds of attacks have indentified against RSA by cryptanalysis. This paper has shown that regardless to the size of secret key and public key, it is possible to decrypt one cipher text by different secret...

We show by an example that in a Verdier triangulated category, there may exist two mutually nonisomorphic Verdier octahedra containing the same commutative triangle.

We show by an example that in a Verdier triangulated category, there may exist two mutually nonisomorphic Verdier octahedra containing the same commutative triangle.

The application of Clifford Analysis methods in Combinatorics has some peculiarities due to the use of noncommutative algebras. But it seems natural to expect from here some new results different from those obtained by using approaches based on several complex variable. For instances, the fact that in Clifford Analysis the point-wise multiplication of monogenic functions as well as their compos...

Let L denote the free Lie ring of rank 2r with free generators xi , yi (1 i r), and let τ be the automorphism of L that interchanges xi and yi for all i . We construct a Z-basis of L that consists of pairs of elements which are interchanged by τ , and elements upon which τ acts as multiplication by −1.

A number of tandemly reiterated sequences are present on the herpes simplex virus type 1 (HSV-1) DNA molecule of 152 kbp. While regions containing tandem reiterations were usually unstable, reiteration VII, which is present within the protein coding regions of gene US10 and US11, was stable; hence, reiteration VII could be used as a genetic marker. In the present study, the nucleotide sequences...

A method is described for performing computations in a finite field GF(2 ) by embedding it in a larger ring Rp where the multiplication operation is a convolution product and the squaring operation is a rearrangement of bits. Multiplication in Rp has complexity N +1, which is approximately twice as efficient as optimal normal basis multiplication (ONB) or Montgomery multiplication in GF(2 ), wh...

As a generalization of double base chains, multibase number system is very suitable for efficient computation of scalar multiplication of a point of elliptic curve because of shorter representation length and hamming weight. In this paper combined with the given formulas for computing the 7Fold of an elliptic curve point P an efficient scalar multiplication algorithm of elliptic curve is propos...

Multiplication and square are elementary mathematical operations extremely important for core computing process. Also exponentiation, the process of raising a base number to a power is an important operation in many numerical computations. To keep pace with the technology, high speed applications require faster methods of multiplication and Square architecture. This paper reports a new faster a...

Non-Boolean computations implementing operations on multi-valued variables beyond base 2 allow enhanced computational complexity. We introduce DNA as a functional material for ternary computing, and in particular demonstrate the use of three-valued oligonucleotide inputs to construct a 3 × 3 multiplication table. The system consists of two three-valued inputs of -1; 0; +1 and a fluorophore/quen...