Content deleted Content added
rv removal of relevant link; see WP:ANI#Emergency: Betacommand deletion at bot speeds - please review impending block |
m cite repair; |
||
(58 intermediate revisions by 41 users not shown) | |||
Line 1:
{{Short description|Family of block ciphers}}
In [[cryptography]], '''SAFER''' ('''Secure
==SAFER K and SAFER SK==
[[
The first SAFER cipher was '''SAFER K-64''', published by Massey in
All of these ciphers use the same round function consisting of four stages, as shown in the diagram: a key-mixing stage, a substitution layer, another key-mixing stage, and finally a diffusion layer. In the first key-mixing stage, the plaintext block is divided into eight 8-bit segments, and subkeys are added using either addition modulo 256 (denoted by a "+" in a square) or [[XOR]] (denoted by a "+" in a circle). The substitution layer consists of two [[S-box]]es, each the inverse of each other, derived from discrete [[exponentiation]] (45<sup>''x''</sup>) and [[logarithm]] (log<sub>45</sub>x) functions. After a second key-mixing stage there is the diffusion layer: a novel cryptographic component termed a [[pseudo-Hadamard transform]] ('''PHT'''). (The PHT was also later used in the [[Twofish]] cipher.)
==SAFER+ and SAFER++==
There are two more-recent members of the SAFER family that have made changes to the main encryption routine, designed by the Armenian cryptographers Gurgen Khachatrian (American University of Armenia) and Melsik Kuregian in conjunction with Massey.
* '''SAFER+''' (Massey et al., 1998) was submitted as a candidate for the [[AES process|Advanced Encryption Standard]] and has a block size of 128 bits. The cipher was not selected as a finalist. [[Bluetooth]] uses custom algorithms based on SAFER+ for key derivation (called E21 and E22) and authentication as [[message authentication code]]s (called E1). Encryption in Bluetooth does not use SAFER+.<ref name="bt-preliminary">{{
* '''SAFER++''' (Massey et al., 2000) was submitted to the [[NESSIE]] project in two versions, one with 64 bits, and the other with 128 bits.
==See also==
* [[
* [[Confusion and diffusion]]
Line 26 ⟶ 27:
* Massey, J. L., "Announcement of a Strengthened Key Schedule for the Cipher SAFER", September 9, 1995.
* James Massey, Gurgen Khachatrian, Melsik Kuregian, "Nomination of SAFER++ as Candidate Algorithm for the New European Schemes for Signatures, Integrity, and Encryption (NESSIE)," Presented at the First Open NESSIE Workshop, November 2000.
* Gurgen Khachatrian, Melsik Kuregian, Karen Ispiryan, James Massey, "Differential analysis of SAFER++ algorithm" – Second NESSIE workshop, Egham, UK, September 12–13, (2001)
* [[Lars R. Knudsen]], A Key-schedule Weakness in SAFER K-64. CRYPTO 1995: 274-286.
* [[Lars R. Knudsen]], [[Tom Berson|Thomas A. Berson]], "Truncated Differentials of SAFER". Fast Software Encryption 1996: 15-26
* Nomination of SAFER+ as Candidate Algorithm for the Advanced Encryption Standard (AES), Submission document from Cylink Corporation to NIST, June 1998.
* Karen Ispiryan "Some family of coordinate permutation for SAFER++" CSIT September 17–20, 2001 Yerevan, Armenia
{{Reflist}}
==External links==
* [http://embeddedsw.net/Cipher_Reference_Home.html 256bit Ciphers - SAFER Reference implementation and derived code]
* [http://www.quadibloc.com/crypto/co040407.htm John Savard's description of SAFER+]
* [http://www.quadibloc.com/crypto/co040301.htm John Savard's description of SAFER K and SAFER SK]
Line 38 ⟶ 42:
* [http://www.users.zetnet.co.uk/hopwood/crypto/scan/cs.html#SAFER-SK SCAN's entry for SAFER SK]
* [http://www.users.zetnet.co.uk/hopwood/crypto/scan/cs.html#SAFER+ SCAN's entry for SAFER+]
* [http://www.users.zetnet.co.uk/hopwood/crypto/scan/cs.html#SAFER++ SCAN's entry for SAFER++] (November 2000)
* [http://groups.google.com/groups?selm=4336pm%24e9t%40net.auckland.ac.nz Announcement of new key schedule (SAFER SK)]
* [https://cliki.net/SAFER SAFER SK-128 in portable Common Lisp]
▲{{Crypto navbox | block}}
[[Category:Block ciphers]]
|