About: Mod n cryptanalysis

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

About: Mod n cryptanalysis Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:MilitaryConflict, within Data Space : el.dbpedia.org associated with source document(s)

In cryptography, mod n cryptanalysis is an attack applicable to block and stream ciphers. It is a form of partitioning cryptanalysis that exploits unevenness in how the cipher operates over equivalence classes (congruence classes) modulo n. The method was first suggested in 1999 by John Kelsey, Bruce Schneier, and David Wagner and applied to RC5P (a variant of RC5) and M6 (a family of block ciphers used in the FireWire standard). These attacks used the properties of binary addition and bit rotation modulo a Fermat prime.

Attributes	Values
rdf:type	military conflict
rdfs:label	Mod n cryptanalysis (en)
rdfs:comment	In cryptography, mod n cryptanalysis is an attack applicable to block and stream ciphers. It is a form of partitioning cryptanalysis that exploits unevenness in how the cipher operates over equivalence classes (congruence classes) modulo n. The method was first suggested in 1999 by John Kelsey, Bruce Schneier, and David Wagner and applied to RC5P (a variant of RC5) and M6 (a family of block ciphers used in the FireWire standard). These attacks used the properties of binary addition and bit rotation modulo a Fermat prime. (en)
sameAs	Mod n cryptanalysis Mod n cryptanalysis
dbp:wikiPageUsesTemplate	dbt:Cite_conference dbt:Cite_journal dbt:No_footnotes dbt:Cryptography_navbox
Subject	Cryptographic attacks Modular arithmetic
gold:hypernym	Attack
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Mod_n_cryptanalysis?oldid=1002200615&ns=0
Wikipage page ID	709367 (xsd:integer)
page length (characters) of wiki page	3274 (xsd:nonNegativeInteger)
Wikipage revision ID	1002200615 (xsd:integer)
Link from a Wikipage to another Wikipage	Block cipher White paper Bruce Schneier Cryptographic attacks Modular arithmetic David A. Wagner Distinguishing attack PDF PostScript Cipher Cryptanalysis Cryptography Key (cryptography) Springer Science+Business Media John Kelsey (cryptanalyst) Partitioning cryptanalysis Vincent Rijmen Equivalence class IEEE 1394 Fermat number International Association for Cryptologic Research Modular arithmetic Stream cipher M6 (cipher) M8 (cipher) RC5 Rabbit (cipher) Rome
has abstract	In cryptography, mod n cryptanalysis is an attack applicable to block and stream ciphers. It is a form of partitioning cryptanalysis that exploits unevenness in how the cipher operates over equivalence classes (congruence classes) modulo n. The method was first suggested in 1999 by John Kelsey, Bruce Schneier, and David Wagner and applied to RC5P (a variant of RC5) and M6 (a family of block ciphers used in the FireWire standard). These attacks used the properties of binary addition and bit rotation modulo a Fermat prime. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Mod_n_cryptanalysis
is Wikipage redirect of	Mod-n cryptanalysis
is Link from a Wikipage to another Wikipage of	David A. Wagner Cryptanalysis List of number theory topics Index of cryptography articles Mod M6 (cipher) M8 (cipher) Mod-n cryptanalysis
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Mod_n_cryptanalysis

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software