Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 M. Andrecut Computer Science , 2015, Abstract: We discuss a matrix public key cryptosystem and its numerical implementation.
 Physics , 2003, DOI: 10.1016/j.physleta.2003.09.042 Abstract: Error function analysis is an effective attack against chaotic cryptograph [PRE 66, 065202(R) (2002)]. The basin structure of the error function is crucial for determining the security of chaotic cryptosystems. In the present paper the basin behavior of the system used in [21] is analyzed in relation with the estimation of its practical security. A S-box algebraic operation is included in the chaotic cryptosystem, which considerably shrinks the basin of the error function and thus greatly enhances the practical security of the system with a little computational expense. PACS numbers: 05.45.Vx, 05.45.Ra
 Computer Science , 2014, Abstract: In this work, we introduce a new, efficient and practical scheme based on the Rabin cryptosystem without using the Jacobi symbol, message redundancy technique or the needs of extra bits in order to specify the correct plaintext. Our system involves only a single prime number as the decryption key and does only one modular exponentiation. Consequently, this will practically reduce the computational efforts during decryption process. We demonstrate that the decryption is unique and proven to be equivalent to factoring.The scheme is performs better when compared to a number of Rabin cryptosystem variants.
 Computer Science , 2010, DOI: 10.5121/ijnsa.2010.2201 Abstract: In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure against all the known attacks. Like Little Dragon cryptosystem the public key of Little Dragon Two is mixed type that is quadratic in plaintext and cipher text variables. So the public key size of Little Dragon Two is equal to Little Dragon Cryptosystem. Our public key algorithm is bijective and can be used for both encryption and signatures.
 International Journal of Network Security & Its Applications , 2010, Abstract: In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure against all the known attacks. Like Little Dragon cryptosystem the public key of Little Dragon Two is mixed type that is quadratic in plaintext and cipher text variables. So the public key size of Little Dragon Two is equal to Little Dragon Cryptosystem. Ourpublic key algorithm is bijective and can be used for both encryption and signatures
 Physics , 1999, DOI: 10.1006/aphy.2001.6117 Abstract: A practical approach is presented which allows the use of a non-invariant regularization scheme for the computation of quantum corrections in perturbative quantum field theory. The theoretical control of algebraic renormalization over non-invariant counterterms is translated into a practical computational method. We provide a detailed introduction into the handling of the Slavnov-Taylor and Ward-Takahashi identities in the Standard Model both in the conventional and the background gauge. Explicit examples for their practical derivation are presented. After a brief introduction into the Quantum Action Principle the conventional algebraic method which allows for the restoration of the functional identities is discussed. The main point of our approach is the optimization of this procedure which results in an enormous reduction of the calculational effort. The counterterms which have to be computed are universal in the sense that they are independent of the regularization scheme. The method is explicitly illustrated for two processes of phenomenological interest: QCD corrections to the decay of the Higgs boson into two photons and two-loop electroweak corrections to the process $B \to X_s \gamma$.
 Chinese Science Bulletin , 1999, DOI: 10.1007/BF02885019 Abstract: FAPKC4, a public key cryptosystem based on automata theory, is generalized so that component automata of compound automata in user’ s public key would not be restricted to memory finite automata. The generalized FAPKC4 can be used in encryption and implementing digital signatures as well.
 Computer Science , 2015, Abstract: We develop a public key cryptosystem based on invariants of diagonalizable groups. Theoretical results about degrees of invariants, which are related to the security of such cryptosystem, are derived. Further, we derive results on invariants of superanalogs of tori.
 An-Ping Li Computer Science , 2008, Abstract: In this paper, we will present a new key exchange cryptosystem based on linear algebra, which take less operations but weaker in security than Diffie-Hellman's one.
 电子与信息学报 , 1991, Abstract: A joint signature, eacryption aad error correction public-key crypto-system is presented based on the NP-complete problem--general decoding problemof linear codes in the algebraic colinig theory.
 Page 1 /100 Display every page 5 10 20 Item