Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Categorizing all linear codes of IPM over \(\mathbb{F}_{2^8} \)

From MaRDI portal
Publication:2120987
Jump to:navigation, search

DOI10.1007/s12095-021-00483-1zbMath1492.94077OpenAlexW3157051357MaRDI QIDQ2120987

Sylvain Guilley, Jean-Luc Danger, Wei Cheng

Publication date: 1 April 2022

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-021-00483-1

zbMATH Keywords

weight enumeratorcoding theorydual distanceoptimal linear codeinner product maskingKissing numberexpanded code


Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Statistical aspects of information-theoretic topics (62B10)



Uses Software

  • Magma
  • GitHub


Cites Work

  • Statistical properties of side-channel and fault injection attacks using coding theory
  • Consolidating inner product masking
  • Inner Product Masking Revisited
  • A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
  • Power Analysis Attacks
  • Cryptographic Hardware and Embedded Systems - CHES 2004
  • Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
  • Fast Software Encryption
  • Binary optimal odd formally self-dual codes.
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2120987&oldid=14621815"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 23:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki