About: Partitioning cryptanalysis

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

About: Partitioning cryptanalysis Goto Sponge NotDistinct Permalink

An Entity of Type : yago:YagoPermanentlyLocatedEntity, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPartitioning_cryptanalysis

In cryptography, partitioning cryptanalysis is a form of cryptanalysis for block ciphers. Developed by Carlo Harpes in 1995, the attack is a generalization of linear cryptanalysis. Harpes originally replaced the bit sums (affine transformations) of linear cryptanalysis with more general balanced Boolean functions. He demonstrated a toy cipher that exhibits resistance against ordinary linear cryptanalysis but is susceptible to this sort of partitioning cryptanalysis. In its full generality, partitioning cryptanalysis works by dividing the sets of possible plaintexts and ciphertexts into efficiently-computable partitions such that the distribution of ciphertexts is significantly non-uniform when the plaintexts are chosen uniformly from a given block of the partition. Partitioning cryptanalys

Attributes	Values
rdf:type	yago:WikicatCryptographicAttacks yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Attack100972621 yago:Event100029378 yago:Operation100955060 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity
rdfs:label	Partitioning cryptanalysis (en)
rdfs:comment	In cryptography, partitioning cryptanalysis is a form of cryptanalysis for block ciphers. Developed by Carlo Harpes in 1995, the attack is a generalization of linear cryptanalysis. Harpes originally replaced the bit sums (affine transformations) of linear cryptanalysis with more general balanced Boolean functions. He demonstrated a toy cipher that exhibits resistance against ordinary linear cryptanalysis but is susceptible to this sort of partitioning cryptanalysis. In its full generality, partitioning cryptanalysis works by dividing the sets of possible plaintexts and ciphertexts into efficiently-computable partitions such that the distribution of ciphertexts is significantly non-uniform when the plaintexts are chosen uniformly from a given block of the partition. Partitioning cryptanalys (en)
dcterms:subject	Cryptographic attacks
Wikipage page ID	13199359 (xsd:integer)
Wikipage revision ID	1002777329 (xsd:integer)
Link from a Wikipage to another Wikipage	Praga, Łódź Voivodeship Mod n cryptanalysis Thomas Jakobsen Cryptography Saint-Malo Cryptanalysis CRYPTON Data Encryption Standard Linear cryptanalysis Affine transformation Cryptographic attacks Eurocrypt Balanced boolean function PDF Partition of a set Fast Software Encryption ASIACRYPT Haifa Jeju Island Serge Vaudenay Block cipher Boolean function PostScript Congruence class New York City Uniform distribution (discrete) Springer-Verlag Czech Technical University James L. Massey dbr:Henri_Gilbert
Link from a Wikipage to an external page	http://citeseer.ist.psu.edu/322881.html http://citeseer.ist.psu.edu/323185.html http://citeseer.ist.psu.edu/48892.html http://citeseer.ist.psu.edu/jakobsen96bounds.html http://crypto.junod.info/a04.pdf http://www.mathmagic.cn/Crypt1998-2003/bibs/1978/19780121.htm https://eprint.iacr.org/2015/968.pdf
sameAs	Partitioning cryptanalysis Partitioning cryptanalysis Partitioning cryptanalysis Partitioning cryptanalysis
dbp:wikiPageUsesTemplate	dbt:Cite_conference dbt:Cite_journal dbt:Dead_link dbt:Cryptography_navbox dbt:Crypto-stub
bot	InternetArchiveBot (en)
date	March 2018 (en)
fix-attempted	yes (en)
has abstract	In cryptography, partitioning cryptanalysis is a form of cryptanalysis for block ciphers. Developed by Carlo Harpes in 1995, the attack is a generalization of linear cryptanalysis. Harpes originally replaced the bit sums (affine transformations) of linear cryptanalysis with more general balanced Boolean functions. He demonstrated a toy cipher that exhibits resistance against ordinary linear cryptanalysis but is susceptible to this sort of partitioning cryptanalysis. In its full generality, partitioning cryptanalysis works by dividing the sets of possible plaintexts and ciphertexts into efficiently-computable partitions such that the distribution of ciphertexts is significantly non-uniform when the plaintexts are chosen uniformly from a given block of the partition. Partitioning cryptanalysis has been shown to be more effective than linear cryptanalysis against variants of DES and CRYPTON. A specific partitioning attack called mod n cryptanalysis uses the congruence classes modulo some integer for partitions. (en)
gold:hypernym	Substantial form
prov:wasDerivedFrom	wikipedia-en:Partitioning_cryptanalysis?oldid=1002777329&ns=0
page length (characters) of wiki page	4220 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Partitioning_cryptanalysis
is Link from a Wikipage to another Wikipage of	Mod n cryptanalysis Index of cryptography articles Linear cryptanalysis
is foaf:primaryTopic of	wikipedia-en:Partitioning_cryptanalysis

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 (61 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software