Back to Search
Start Over
Constant-time higher-order Boolean-to-arithmetic masking
- Source :
- Journal of Cryptographic Engineering. 9:173-184
- Publication Year :
- 2018
- Publisher :
- Springer Science and Business Media LLC, 2018.
-
Abstract
- Converting a Boolean mask to an arithmetic mask, and vice versa, is often required in implementing side-channel-resistant instances of cryptographic algorithms that mix Boolean and arithmetic operations. In this paper, we describe a method for converting a Boolean mask to an arithmetic mask that runs in constant time for a fixed order and has quadratic complexity as the security order increases, a significant improvement in previous work that has exponential complexity. We propose explicit algorithms for a second-order secure Boolean-to-arithmetic mask conversion that uses 31 instructions and for a third-order secure mask conversion that uses 74 instructions. We show that our second-order secure algorithm is at least an order of magnitude faster and our third-order secure algorithm is more than twice as fast as other algorithms in the literature.
- Subjects :
- Exponential complexity
Computer Networks and Communications
business.industry
Computer science
Quadratic complexity
Cryptography
0102 computer and information sciences
02 engineering and technology
01 natural sciences
Masking (Electronic Health Record)
020202 computer hardware & architecture
010201 computation theory & mathematics
0202 electrical engineering, electronic engineering, information engineering
Arithmetic
business
Computer communication networks
Versa
Software
Order of magnitude
Computer Science::Cryptography and Security
Subjects
Details
- ISSN :
- 21908516 and 21908508
- Volume :
- 9
- Database :
- OpenAIRE
- Journal :
- Journal of Cryptographic Engineering
- Accession number :
- edsair.doi...........37eab670c9bf3b73e2bb52b091884443