Sparse Matrix Sparse Vector Multiplication - A Novel Approach

Author(s):  
Monika Shah
Cryptography ◽  
2020 ◽  
pp. 239-256
Author(s):  
Shaligram Prajapat ◽  
Ramjeevan Singh Thakur

“Key” plays a vital role in every symmetric key cryptosystem. The obvious way of enhancing security of any cryptosystem is to keep the key as large as possible. But it may not be suitable for low power devices since higher computation will be done for longer keys and that will increase the power requirement which decreases the device's performance. In order to resolve the former specified problem an alternative approach can be used in which the length of key is fixed and its value varies in every session. This is Time Variant Key approach or Automatic Variable Key (AVK) approach. The Security of AVK based cryptosystem is enhanced by exchanging some parameters instead of keys between the communicating parties, then these parameters will be used to generate required keys at the receiver end. This chapter presents implementation of the above specified Mechanism. A model has been demonstrated with parameterized scheme and issues in AVK approach. Further, it has been analyzed from different users' perspectives. This chapter also highlights the benefits of AVK model to ensure two levels of security with characterization of methods for AVK and Estimation of key computation based on parameters only. The characteristic components of recent styles of key design with consideration of key size, life time of key and breaking threshold has also been pointed out. These characteristics are essential in the design of efficient symmetric key cryptosystem. The novel approach of AVK based cryptosystem is suitable for low power devices and useful for exchanging very large objects or files. This scheme has been demonstrated with Fibonacci-Q matrix and sparse matrix based diffused key information exchange procedures. These models have been further tested from perspective of hackers and cryptanalyst, to exploit any weakness with fixed size dynamic keys.


Identification is one of the important concerns of information security, that is widely used in our daily e-systems to approve authorised users. With the advent of quantum computers, development of quantum secure identification schemes is essential. In this paper, we give the implementation details of quantum secure Kawachi’s and Cayrel’s identification schemes performed in JavaScript. The hardness of these schemes is based on lattice-based problem SIS in post-quantum cryptography, which requires matrix-vector product operations for its execution. It’s important that for efficient implementation choosing an algorithm with low complexity needs more careful. Therefore, in identification schemes chosen for this study, we use algorithms specific to those schemes’ parameter properties. Then, we carry out matrix by sparse vector and sparse matrix by vector product operations.We provide experimental results of both standard and property-specific algorithms’ execution with their comparison. According to the experimental results, we receive improvements in the specific implementations.


Author(s):  
Shaligram Prajapat ◽  
Ramjeevan Singh Thakur

“Key” plays a vital role in every symmetric key cryptosystem. The obvious way of enhancing security of any cryptosystem is to keep the key as large as possible. But it may not be suitable for low power devices since higher computation will be done for longer keys and that will increase the power requirement which decreases the device's performance. In order to resolve the former specified problem an alternative approach can be used in which the length of key is fixed and its value varies in every session. This is Time Variant Key approach or Automatic Variable Key (AVK) approach. The Security of AVK based cryptosystem is enhanced by exchanging some parameters instead of keys between the communicating parties, then these parameters will be used to generate required keys at the receiver end. This chapter presents implementation of the above specified Mechanism. A model has been demonstrated with parameterized scheme and issues in AVK approach. Further, it has been analyzed from different users' perspectives. This chapter also highlights the benefits of AVK model to ensure two levels of security with characterization of methods for AVK and Estimation of key computation based on parameters only. The characteristic components of recent styles of key design with consideration of key size, life time of key and breaking threshold has also been pointed out. These characteristics are essential in the design of efficient symmetric key cryptosystem. The novel approach of AVK based cryptosystem is suitable for low power devices and useful for exchanging very large objects or files. This scheme has been demonstrated with Fibonacci-Q matrix and sparse matrix based diffused key information exchange procedures. These models have been further tested from perspective of hackers and cryptanalyst, to exploit any weakness with fixed size dynamic keys.


2020 ◽  
Vol 15 (4) ◽  
Author(s):  
Wei Fan ◽  
Hui Ren ◽  
Ren Ju ◽  
Weidong Zhu

Abstract A novel approach is developed to approximate the full mass matrix in the rotational-coordinate-based beam formulation, which can improve the efficiency of calculating its inverse in dynamic analyses. While the rotational-coordinate-based beam formulation can reduce numbers of elements and generalized coordinates, its mass matrix is a full matrix, such that corresponding Jacobian matrix is also full, and it is time-consuming to calculate its inverse. To increase efficiency of calculating its inverse, the full mass matrix is approximated in this work. Two approximations are adopted: (1) a double integral is approximated by a single integral; and (2) a full matrix is approximated by a sum of several rank-one matrices. Through this way, the approximate mass matrix can be decomposed as a band-diagonal sparse matrix and multiplication of low-rank matrices, and its inverse can be efficiently calculated using Sherman–Woodbury formula. Through this way, the approximate mass matrix can be efficiently calculated. Several numerical examples are presented to demonstrate the performance of the current approach, and its accuracy and efficiency are analyzed.


2019 ◽  
Vol 476 (24) ◽  
pp. 3705-3719 ◽  
Author(s):  
Avani Vyas ◽  
Umamaheswar Duvvuri ◽  
Kirill Kiselyov

Platinum-containing drugs such as cisplatin and carboplatin are routinely used for the treatment of many solid tumors including squamous cell carcinoma of the head and neck (SCCHN). However, SCCHN resistance to platinum compounds is well documented. The resistance to platinum has been linked to the activity of divalent transporter ATP7B, which pumps platinum from the cytoplasm into lysosomes, decreasing its concentration in the cytoplasm. Several cancer models show increased expression of ATP7B; however, the reason for such an increase is not known. Here we show a strong positive correlation between mRNA levels of TMEM16A and ATP7B in human SCCHN tumors. TMEM16A overexpression and depletion in SCCHN cell lines caused parallel changes in the ATP7B mRNA levels. The ATP7B increase in TMEM16A-overexpressing cells was reversed by suppression of NADPH oxidase 2 (NOX2), by the antioxidant N-Acetyl-Cysteine (NAC) and by copper chelation using cuprizone and bathocuproine sulphonate (BCS). Pretreatment with either chelator significantly increased cisplatin's sensitivity, particularly in the context of TMEM16A overexpression. We propose that increased oxidative stress in TMEM16A-overexpressing cells liberates the chelated copper in the cytoplasm, leading to the transcriptional activation of ATP7B expression. This, in turn, decreases the efficacy of platinum compounds by promoting their vesicular sequestration. We think that such a new explanation of the mechanism of SCCHN tumors’ platinum resistance identifies novel approach to treating these tumors.


2020 ◽  
Vol 51 (3) ◽  
pp. 544-560 ◽  
Author(s):  
Kimberly A. Murphy ◽  
Emily A. Diehm

Purpose Morphological interventions promote gains in morphological knowledge and in other oral and written language skills (e.g., phonological awareness, vocabulary, reading, and spelling), yet we have a limited understanding of critical intervention features. In this clinical focus article, we describe a relatively novel approach to teaching morphology that considers its role as the key organizing principle of English orthography. We also present a clinical example of such an intervention delivered during a summer camp at a university speech and hearing clinic. Method Graduate speech-language pathology students provided a 6-week morphology-focused orthographic intervention to children in first through fourth grade ( n = 10) who demonstrated word-level reading and spelling difficulties. The intervention focused children's attention on morphological families, teaching how morphology is interrelated with phonology and etymology in English orthography. Results Comparing pre- and posttest scores, children demonstrated improvement in reading and/or spelling abilities, with the largest gains observed in spelling affixes within polymorphemic words. Children and their caregivers reacted positively to the intervention. Therefore, data from the camp offer preliminary support for teaching morphology within the context of written words, and the intervention appears to be a feasible approach for simultaneously increasing morphological knowledge, reading, and spelling. Conclusion Children with word-level reading and spelling difficulties may benefit from a morphology-focused orthographic intervention, such as the one described here. Research on the approach is warranted, and clinicians are encouraged to explore its possible effectiveness in their practice. Supplemental Material https://doi.org/10.23641/asha.12290687


Sign in / Sign up

Export Citation Format

Share Document