Polynomial Evaluation and Side Channel Analysis
From MaRDI portal
Publication:2803637
DOI10.1007/978-3-662-49301-4_20zbMath1405.94050OpenAlexW2500603846MaRDI QIDQ2803637
Claude Carlet, Emmanuel Prouff
Publication date: 2 May 2016
Published in: The New Codebreakers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49301-4_20
Related Items (2)
Multi-Party Secure Computation of Multi-Variable Polynomials ⋮ On decompositions of permutation polynomials into quadratic and cubic power permutations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient and optimal exponentiation in finite fields
- The evaluation of polynomials
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Higher-Order Side Channel Security and Mask Refreshing
- How to share a secret
- Attack on a Higher-Order Masking of the AES Based on Homographic Functions
- Higher-Order Glitches Free Implementation of the AES Using Secure Multi-party Computation Protocols
- Protecting AES with Shamir’s Secret Sharing Scheme
- A Fast and Provably Secure Higher-Order Masking of AES S-Box
- Evaluation of polynomials by computer
- An efficient optimal normal basis type II multiplier
- Algebraic Decomposition for Probing Security
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- PRESENT: An Ultra-Lightweight Block Cipher
- A New DPA Countermeasure Based on Permutation Tables
- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
- Provably Secure Higher-Order Masking of AES
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Higher-Order Masking Schemes for S-Boxes
- Conversion of Security Proofs from One Leakage Model to Another: A New Issue
- Theory and Practice of a Leakage Resilient Masking Scheme
- Masking against Side-Channel Attacks: A Formal Security Proof
- Towards sound approaches to counteract power-analysis attacks
- Efficient Masked S-Boxes Processing – A Step Forward –
- Fast Evaluation of Polynomials over Binary Finite Fields and Application to Side-Channel Countermeasures
- Cryptographic Hardware and Embedded Systems - CHES 2004
- On the Practical Security of a Leakage Resilient Masking Scheme
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- Higher Order Masking of Look-Up Tables
- Efficient Multiplication Using Type 2 Optimal Normal Bases
- Advances in Cryptology - CRYPTO 2003
- Secure Computation from Random Error Correcting Codes
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Topics in Cryptology – CT-RSA 2005
- Topics in Cryptology – CT-RSA 2006
- Information Security and Cryptology - ICISC 2005
- Fast Software Encryption
This page was built for publication: Polynomial Evaluation and Side Channel Analysis
