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
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
154
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...
Improvement of Transform-Skip Mode in Lossy Intra Coding with 3-Tap Filters
Alvar, Saeed Ranjbar; Kamışlı, Fatih (2016-08-05)
Using transforms in video coding is an effective method in reducing the spatial redundancy. However, for some cases applying transforms does not reduce the spatial redundancy. For these cases, transforms are skipped and the prediction error is directly quantized and then entropy coded. To further reduce the spatial redundancy in the transform skipped blocks, a pixel-by-pixel lossy intra prediction method based on a two dimensional correlation model is proposed in this paper. In the proposed method, three re...
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.
Construction of self dual codes from graphs
Fellah, Nazahet; Guenda, Kenza; Özbudak, Ferruh; Seneviratne, Padmapani (2022-07-01)
In this work we define and study binary codes C-q,C-k and (C-q,C-k) over bar obtained from neighbor- hood designs of Paley-type bipartite graphs P(q, k) and their complements, respectively for q an odd prime. We prove that for some values of q and k the codes C-q,C-k are self-dual and the codes (C-q,C-k) over bar are self-orthogonal. Most of these codes tend to be with optimal or near optimal parameters. Next, we extend the codes C(q,k )to get doubly even self dual codes and find that most of these codes ar...
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.