My Account | Careers | Downloads | Blog

PROJECT TITLE :

Further Improving Efficiency of Higher-Order Masking Schemes by Decreasing Randomness Complexitys - 2017

ABSTRACT:

Most cryptographic implementations are prone to side-channel attacks. Among the countermeasures, masking is the most common one. In the sphere of provable secure masking schemes, it is a tough task to design a masking scheme for the multiplication with related multiplicands. Among all the corresponding solutions, the one proposed by Coron et al. in FSE 2013 achieves the most effective potency. Furthermore, in CRYPTO 2015, we have a tendency to claim that this theme will be extended to secure any quadratic functions and therefore allows secure evaluation of S-box, that considerably outperforms any other ways. During this paper, we tend to additional promote the efficiency of Coron's theme by decreasing the random generations according to two observations. 1st, by modifying each combine of intermediate values on two sides of a diagonal line, 0.5 of all the specified random values will be removed. Second, some randomness can be reused. All random values in one out of two lines can be replaced with the identical random value. According to those 2 observations, we have a tendency to propose 2 new schemes. The primary proposal improves the initial scheme with a fifty% randomness reduction and satisfies a stronger compositional security notion d -SNI, while the second proposal improves the original theme with a 50percent-seventy fivepercent randomness reduction and satisfies a weaker compositional security notion d -TNI. We have a tendency to give the security proof for each schemes. Moreover, we provide an example of the masked Advanced Encryption Normal (AES) inversion circuits where both the first and second proposals are applied, considerably outperforming the initial AES inversion with a 43percent-fifty sevenpercent saving of random generations. This indicates that our proposals can be used to create secure and efficient implementations of cryptographic algorithms.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Improving I/O Complexity of Triangle Enumeration ABSTRACT: Many graph algorithms are now required to operate in external memory and deliver performance that does not significantly degrade with the scale of the
PROJECT TITLE : Improving Speech Emotion Recognition With Adversarial Data Augmentation Network ABSTRACT: When there aren't many training data to work with, it can be difficult to train a deep neural network without triggering
PROJECT TITLE : A Time-Series Feature-Based Recursive Classification Model to Optimize Treatment Strategies for Improving Outcomes and Resource Allocations of COVID-19 Patients ABSTRACT: This paper presents a novel Lasso Logistic
PROJECT TITLE : Recommender Systems and Scratch An integrated approach for enhancing computer programming learning ABSTRACT: Learning computer programming is a difficult task. Visual programming languages (VPLs), such as Scratch,
PROJECT TITLE : Using Cost-Sensitive Learning and Feature Selection Algorithms to Improve the Performance of Imbalanced Classification ABSTRACT: The problem of unbalanced data is common in network intrusion detection, spam filtering,

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry