Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Construction of Some Codes Suitable for Both Side Channel and Fault Injection Attacks
Date
2018-12-30
Author
Carlet, Claude
GÜNERİ, CEM
Mesnager, Sihem
Özbudak, Ferruh
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
259
views
0
downloads
Cite This
Using algebraic curves over finite fields, we construct some codes suitable for being used in the countermeasure called Direct Sum Masking which allows, when properly implemented, to protect the whole cryptographic block cipher algorithm against side channel attacks and fault injection attacks, simultaneously. These codes address a problem which has its own interest in coding theory.
Subject Keywords
SCA
,
FIA
,
MDS code
,
Algebraic geometry code
URI
https://hdl.handle.net/11511/43888
DOI
https://doi.org/10.1007/978-3-030-05153-2_5
Collections
Department of Mathematics, Conference / Seminar
Suggestions
OpenMETU
Core
Belief propagation decoding of polar codes under factor graph permutations
Peker, Ahmet Gökhan; Yücel, Melek Diker; Department of Electrical and Electronics Engineering (2018)
Polar codes, introduced by Arıkan, are linear block codes that can achieve the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Polar codes of block length N are constructed by channel polarization method, which consists of channel combining and splitting operations to obtain N polarized subchannels from N copies of binary-input discrete memoryless channels. As N grows, symmetric channel capacities of the polarized subchannels converge to either 0 or...
Design and fpga implementation of an efficient deinterleaving algorithm
Olgun, Muhammet Ertuğ; Akar, Gözde; Department of Electrical and Electronics Engineering (2008)
In this work, a new deinterleaving algorithm that can be used as a part of an ESM system and its implementation by using an FPGA is studied. The function of the implemented algorithm is interpreting the complex electromagnetic military field in order to detect and determine different RADARs and their types by using incoming RADAR pulses and their PDWs. It is assumed that RADAR signals in the space are received clearly and PDW of each pulse is generated as an input to the implemented algorithm system. Cluste...
A new concatenated type construction for LCD codes and isometry codes
CARLET, Claude; Guneri, Cem; Özbudak, Ferruh; SOLÉ, Patrick (2018-03-01)
We give a new concatenated type construction for linear codes with complementary dual (LCD) over small finite fields. In this construction, we need a special class of inner codes that we call isometry codes. Our construction generalizes a recent construction of Carlet et al. (2014-2016) and of Gtineri et al. (2016). In particular, it allows us to construct LCD codes with improved parameters directly.
Additive cyclic complementary dual codes over F4
Shi, Minjia; Liu, Na; Özbudak, Ferruh; Solé, Patrick (2022-10-01)
© 2022 Elsevier Inc.An additive cyclic code of length n over F4 can be defined equivalently as an F2[x]/〈xn+1〉-submodule of F4[x]/〈xn+1〉. In this paper we study additive cyclic and complementary dual codes of odd length over F4 with respect to the trace Hermitian inner product and the trace Euclidean inner product. We characterize subfield subcodes and trace codes of these codes by their generators as binary cyclic codes.
Design of S-boxes by concatenation of rotation-symmetric S-boxes
Baloğlu, Sevdenur; Özbudak, Ferruh; Kavut, Selçuk; Department of Cryptography (2016)
In most of the block cipher cryptosystems, the substitution boxes, or so-called S-boxes, are the only nonlinear components, and hence the strength of these cryptosystems depends heavily on the cryptographic properties of the S-boxes. In this thesis, it is aimed to design S-boxes which are on one hand strong in terms of traditional cryptographic properties such as nonlinearity, differential uniformity, absolute indicator and algebraic degree, and on the other hand resistant to side-channel attacks such as di...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
C. Carlet, C. GÜNERİ, S. Mesnager, and F. Özbudak, “Construction of Some Codes Suitable for Both Side Channel and Fault Injection Attacks,” 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43888.