About: Piling-up lemma

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Piling-up lemma Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Statement106722453, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPiling-up_lemma

In cryptanalysis, the piling-up lemma is a principle used in linear cryptanalysis to construct linear approximations to the action of block ciphers. It was introduced by Mitsuru Matsui (1993) as an analytical tool for linear cryptanalysis. The lemma states that the bias (deviation of the expected value from 1/2) of a linear Boolean function (XOR-clause) of independent binary random variables is related to the product of the input biases: or where is the bias (towards zero) and the imbalance: . Conversely, if the lemma does not hold, then the input variables are not independent.

Attributes	Values
rdf:type	agent yago:WikicatCryptographicAttacks yago:WikicatLemmas yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Attack100972621 yago:Communication100033020 yago:Event100029378 yago:Lemma106751833 yago:Message106598915 yago:Operation100955060 yago:Proposition106750804 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Statement106722453
rdfs:label	Lemme d'empilement (fr) Teorema dell'impilamento (it) Piling-up lemma (en)
rdfs:comment	In cryptanalysis, the piling-up lemma is a principle used in linear cryptanalysis to construct linear approximations to the action of block ciphers. It was introduced by Mitsuru Matsui (1993) as an analytical tool for linear cryptanalysis. The lemma states that the bias (deviation of the expected value from 1/2) of a linear Boolean function (XOR-clause) of independent binary random variables is related to the product of the input biases: or where is the bias (towards zero) and the imbalance: . Conversely, if the lemma does not hold, then the input variables are not independent. (en) Le lemme d'empilement (le Piling-up Lemma en anglais) est un résultat statistique introduit par Mitsuru Matsui en 1993 dans le cadre de la cryptanalyse linéaire. Ce lemme permet de quantifier le biais statistique présent dans une approximation linéaire d'un algorithme de chiffrement symétrique par bloc. (fr) In crittanalisi il teorema dell'impilamento (piling-up lemma) è un principio utilizzato nella crittanalisi lineare per costruire le approssimazioni lineari dei cifrari a blocchi. È stato introdotto da Mitsuru Matsui nel 1993 come uno strumento analitico della crittanalisi lineare. (it)
dcterms:subject	Lemmas Cryptographic attacks
Wikipage page ID	715186 (xsd:integer)
Wikipage revision ID	1084899202 (xsd:integer)
Link from a Wikipage to another Wikipage	Product distribution Bernoulli distribution Lemmas Variance Dependent and independent variables Covariance Correlation coefficient Cryptanalysis Linear approximation Parity function Linear cryptanalysis Cryptographic attacks Expected value Probability S-box Binary variable Block cipher Mitsuru Matsui Uncorrelatedness (probability theory) Mutually exclusive events Probability one Xor
sameAs	Piling-up lemma Piling-up lemma Piling-up lemma Piling-up lemma Piling-up lemma Piling-up lemma
dbp:wikiPageUsesTemplate	dbt:' dbt:Reflist dbt:Short_description dbt:Cryptography_navbox
has abstract	In cryptanalysis, the piling-up lemma is a principle used in linear cryptanalysis to construct linear approximations to the action of block ciphers. It was introduced by Mitsuru Matsui (1993) as an analytical tool for linear cryptanalysis. The lemma states that the bias (deviation of the expected value from 1/2) of a linear Boolean function (XOR-clause) of independent binary random variables is related to the product of the input biases: or where is the bias (towards zero) and the imbalance: . Conversely, if the lemma does not hold, then the input variables are not independent. (en) Le lemme d'empilement (le Piling-up Lemma en anglais) est un résultat statistique introduit par Mitsuru Matsui en 1993 dans le cadre de la cryptanalyse linéaire. Ce lemme permet de quantifier le biais statistique présent dans une approximation linéaire d'un algorithme de chiffrement symétrique par bloc. (fr) In crittanalisi il teorema dell'impilamento (piling-up lemma) è un principio utilizzato nella crittanalisi lineare per costruire le approssimazioni lineari dei cifrari a blocchi. È stato introdotto da Mitsuru Matsui nel 1993 come uno strumento analitico della crittanalisi lineare. (it)
gold:hypernym	Principle
prov:wasDerivedFrom	wikipedia-en:Piling-up_lemma?oldid=1084899202&ns=0
page length (characters) of wiki page	8398 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Piling-up_lemma
is Link from a Wikipage to another Wikipage of	Index of cryptography articles List of lemmas Hardware random number generator Parity function Piling (disambiguation) Linear cryptanalysis Binomial distribution Relationships among probability distributions Boolean function Piling up lemma
is Wikipage redirect of	Piling up lemma
is Wikipage disambiguates of	Piling (disambiguation)
is foaf:primaryTopic of	wikipedia-en:Piling-up_lemma

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software