About: Treyfer

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

About: Treyfer Goto Sponge NotDistinct Permalink

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

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

In cryptography, Treyfer is a block cipher/MAC designed in 1997 by Gideon Yuval. Aimed at smart card applications, the algorithm is extremely simple and compact; it can be implemented in just 29 bytes of 8051 machine code. Due to the simplicity of its key schedule, using the same eight key bytes in each round, Treyfer was one of the first ciphers shown to be susceptible to a slide attack. This cryptanalysis, which is independent of the number of rounds and the choice of S-box, requires 232 known plaintexts and 244 computation time.

Attributes	Values
rdf:type	yago:WikicatBrokenBlockCiphers yago:Abstraction100002137 yago:Cipher106254239 yago:Communication100033020 yago:Message106253690
rdfs:label	Treyfer (en)
rdfs:comment	In cryptography, Treyfer is a block cipher/MAC designed in 1997 by Gideon Yuval. Aimed at smart card applications, the algorithm is extremely simple and compact; it can be implemented in just 29 bytes of 8051 machine code. Due to the simplicity of its key schedule, using the same eight key bytes in each round, Treyfer was one of the first ciphers shown to be susceptible to a slide attack. This cryptanalysis, which is independent of the number of rounds and the choice of S-box, requires 232 known plaintexts and 244 computation time. (en)
name	Treyfer (en)
dcterms:subject	Broken block ciphers
Wikipage page ID	9138303 (xsd:integer)
Wikipage revision ID	1124098910 (xsd:integer)
Link from a Wikipage to another Wikipage	David A. Wagner Cryptography Key (cryptography) Key schedule Key size Broken block ciphers Machine code Alex Biryukov Block cipher Block size (cryptography) Tiny Encryption Algorithm PostScript Known-plaintext attack Message authentication code Slide attack Smart card 8051 Substitution box
Link from a Wikipage to an external page	http://www.cs.berkeley.edu/~daw/papers/slide-fse99-pre.ps
sameAs	Treyfer Treyfer Treyfer Treyfer
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_document dbt:Notability dbt:Refimprove dbt:Short_description dbt:Cryptography_navbox dbt:Crypto-stub dbt:Infobox_block_cipher
rounds	32 (xsd:integer)
designers	Gideon Yuval (en)
has abstract	In cryptography, Treyfer is a block cipher/MAC designed in 1997 by Gideon Yuval. Aimed at smart card applications, the algorithm is extremely simple and compact; it can be implemented in just 29 bytes of 8051 machine code. Treyfer has a rather small key size and block size of 64 bits each. All operations are byte-oriented, and there is a single 8×8-bit S-box. The S-box is left undefined; the implementation can simply use whatever data is available in memory. In each round, each byte has added to it the S-box value of the sum of a key byte and the previous data byte, then it is rotated left one bit. The design attempts to compensate for the simplicity of this round transformation by using 32 rounds. Due to the simplicity of its key schedule, using the same eight key bytes in each round, Treyfer was one of the first ciphers shown to be susceptible to a slide attack. This cryptanalysis, which is independent of the number of rounds and the choice of S-box, requires 232 known plaintexts and 244 computation time. (en)
block size	64 (xsd:integer)
cryptanalysis	A slide attack using 232 known plaintexts and 244 work succeeds for any number of rounds (en)
key size	64 (xsd:integer)
publish date	1997 (xsd:integer)
gold:hypernym	MAC
prov:wasDerivedFrom	wikipedia-en:Treyfer?oldid=1124098910&ns=0
page length (characters) of wiki page	3713 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Treyfer
is Link from a Wikipage to another Wikipage of	Encryption by date Index of cryptography articles Tiny Encryption Algorithm
is foaf:primaryTopic of	wikipedia-en:Treyfer

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