Optical adder for residue numbers

Defensins containing a consensus cystine framework, Cys[1]…Cys[2]X3Cys[3]…Cys[4]… Cys[5]X1Cys[6] (X, any amino acid except Cys; …, variable residue numbers), are extensively distributed in a variety of multicellular organisms (plants, fungi and invertebrates) and essentially involved in immunity as microbicidal agents. This framework is a prerequisite for forming the cysteine-stabilized α-helix and β-sheet (CSαβ) fold, in which the two invariant motifs, Cys[2]X3Cys[3]/Cys[5]X1Cys[6], are key determinants of fold formation. By using a computational genomics approach, we identified a large superfamily of fungal defensin-like peptides (fDLPs) in the phytopathogenic fungal genus – Zymoseptoria, which includes 132 structurally typical and 63 atypical members. These atypical fDLPs exhibit an altered cystine framework and accompanying fold change associated with their secondary structure elements and disulfide bridge patterns, as identified by protein structure modelling. Despite this, they definitely are homologous with the typical fDLPs in view of their precise gene structure conservation and identical precursor organization. Sequence and structural analyses combined with functional data suggest that most of Zymoseptoria fDLPs might have lost their antimicrobial activity. The present study provides a clear example of fold change in the evolution of proteins and is valuable in establishing remote homology among peptide superfamily members with different folds.

Download Full-text

Algorithm for Clustering the Moduli of RNS for the Application of Optimization of Time Complexity in Standard Cipher System

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.f4137.059720 ◽

2020 ◽

Vol 9 (7) ◽

pp. 92-97

Keyword(s):

High Speed ◽

High Performance ◽

Fault Tolerant ◽

Number System ◽

Residue Number System ◽

New Method ◽

Residue Number ◽

Residue Numbers ◽

Performance Computing ◽

Selection Of

Residue number system (RNS) has emerged as a knocking field of research due to its high speed, fault tolerant, carry free and parallel characteristics. Due to these features it has got important role in high performance computing especially with reduced delay. There are various algorithms have been found as a result of the research with respect to RNS. Additionally, since RNS reduces word length due to the modular operations, its computations are faster compared to binary computations. But the major challenges are the selection of moduli sets for the forward (decimal to residue numbers) and reverse (residue numbers to decimal) conversion. RNS performance is purely depending on how efficiently an algorithm computes / chooses the moduli sets [1]-[6]. This paper proposes new method for selecting the moduli sets and its usage in cryptographic applications based on Schonhage modular factorization. The paper proposes six moduli sets {6qk1, 6qk+1, 6qk+3, 6qk+5, 6qk+7, 6qk+11} for the RNS conversions but the Schonhage moduli sets are expressed as the exponents that creates a large gap between the moduli’s computed. Hence, a new method is proposed to for computing moduli sets that helps in representing all the decomposed values approximately in the same range.

Download Full-text