1
data encryption standard ,des animated  tutorial
data encryption standard ,des animated tutorial
DATE: 2014/08/03::
2
symmetric key cryptography
symmetric key cryptography
DATE: 2014/08/06::
3
3 - 2 - The Data Encryption Standard -Cryptography-Professor Dan Boneh
3 - 2 - The Data Encryption Standard -Cryptography-Professor Dan Boneh
DATE: 2012/04/16::
4
Symmetric Key and Public Key Encryption
Symmetric Key and Public Key Encryption
DATE: 2013/06/18::
5
A New selective image encryption approach
A New selective image encryption approach
DATE: 2014/06/11::
6
Simplified DES Example (CSS322, Lecture 5, 2013)
Simplified DES Example (CSS322, Lecture 5, 2013)
DATE: 2013/11/26::
7
webmin kali proxy wlan
webmin kali proxy wlan
DATE: 2014/12/25::
8
DATA ENCRYPTION STANDARD (DES) netwinz
DATA ENCRYPTION STANDARD (DES) netwinz
DATE: 2011/06/17::
9
BMW X5 KEY PROGRAMMING WITH CAR KEY MASTER
BMW X5 KEY PROGRAMMING WITH CAR KEY MASTER
DATE: 2014/12/28::
10
Car Key Master CKM200 write key for Benz DAS2
Car Key Master CKM200 write key for Benz DAS2
DATE: 2014/03/07::
11
Data Encryption Standard
Data Encryption Standard
DATE: 2014/08/13::
12
Mod-01 Lec-11 Block Cipher Standards (DES)
Mod-01 Lec-11 Block Cipher Standards (DES)
DATE: 2012/05/17::
13
Is Transparent Data Encryption a Good Choice for Your Data?
Is Transparent Data Encryption a Good Choice for Your Data?
DATE: 2014/07/29::
14
Fundamentals of Next Generation Encryption
Fundamentals of Next Generation Encryption
DATE: 2012/11/08::
15
What is Data Encryption?
What is Data Encryption?
DATE: 2013/05/08::
16
NSA cracked most online encryption
NSA cracked most online encryption
DATE: 2013/09/14::
17
Entity authentication and symmetric key establishment
Entity authentication and symmetric key establishment
DATE: 2014/07/06::
18
Implementation of LSB Steganography | Steganography with image
Implementation of LSB Steganography | Steganography with image
DATE: 2014/05/09::
19
How to encrypt your Android device
How to encrypt your Android device
DATE: 2013/12/30::
20
Why the NSA is breaking our encryption -- and why we should care | Matthew Green | TEDxMidAtlantic
Why the NSA is breaking our encryption -- and why we should care | Matthew Green | TEDxMidAtlantic
DATE: 2014/10/20::
21
NASA LOOSES International SPACE STATION Codes on STOLEN LAPTOP
NASA LOOSES International SPACE STATION Codes on STOLEN LAPTOP
DATE: 2012/03/03::
22
Encrypt your data on the Cloud
Encrypt your data on the Cloud
DATE: 2012/07/15::
23
Encryption Box on Security Accreditations and trusting UKFast with their Future
Encryption Box on Security Accreditations and trusting UKFast with their Future
DATE: 2013/11/26::
24
Promat Video Identification Parade Software Demonstration
Promat Video Identification Parade Software Demonstration
DATE: 2014/03/03::
25
Defcon 21 - A Password is Not Enough: Why Disk Encryption is Broken and How We Might Fix It
Defcon 21 - A Password is Not Enough: Why Disk Encryption is Broken and How We Might Fix It
DATE: 2013/11/16::
26
What Can We Learn from Edward Snowden
What Can We Learn from Edward Snowden
DATE: 2014/06/17::
27
Know How... 50: Encrypt your email with PGP
Know How... 50: Encrypt your email with PGP
DATE: 2013/06/27::
28
Jon Callas on smart phone encryption
Jon Callas on smart phone encryption
DATE: 2014/06/03::
29
Symmetric Key Encryption and Brute Forece (ITS335, L3, Y14)
Symmetric Key Encryption and Brute Forece (ITS335, L3, Y14)
DATE: 2015/01/27::
30
Upload file with encryption and download file with decryption using asp.net c#.
Upload file with encryption and download file with decryption using asp.net c#.
DATE: 2013/11/22::
31
Understanding Export Controls for Encryption Items
Understanding Export Controls for Encryption Items
DATE: 2012/03/16::
32
Intro to AES Encryption - Part 3
Intro to AES Encryption - Part 3
DATE: 2009/01/28::
33
How to remove Dirtydecrypt.exe /"File is encrypted" virus
How to remove Dirtydecrypt.exe /"File is encrypted" virus
DATE: 2013/07/08::
34
Affine Cipher Part 1 - Encryption
Affine Cipher Part 1 - Encryption
DATE: 2015/03/12::
35
Help Me to Decrypt Encrypted Files.mp4
Help Me to Decrypt Encrypted Files.mp4
DATE: 2012/02/15::
36
RSA Key Generation, Signatures and Encryption using OpenSSL
RSA Key Generation, Signatures and Encryption using OpenSSL
DATE: 2012/03/15::
37
Brocade 6510 - VF, FCR, Encryption/Compression
Brocade 6510 - VF, FCR, Encryption/Compression
DATE: 2013/02/13::
38
Phil Zimmermann: Protecting the Confidentiality of Private Communications | Security Change Agents
Phil Zimmermann: Protecting the Confidentiality of Private Communications | Security Change Agents
DATE: 2014/08/05::
39
How To Install Advanced Archive Password Recovery Professional 4.54
How To Install Advanced Archive Password Recovery Professional 4.54
DATE: 2015/02/17::
40
Encrypt your passwords with MD5 hashing in C#
Encrypt your passwords with MD5 hashing in C#
DATE: 2014/04/19::
41
DES Encryption using OpenSSL
DES Encryption using OpenSSL
DATE: 2012/02/01::
42
Survival tip: Sensitive data storage, backup and encryption
Survival tip: Sensitive data storage, backup and encryption
DATE: 2014/02/18::
43
Image steganography in DWT domain using double stegging with RSA encryption
Image steganography in DWT domain using double stegging with RSA encryption
DATE: 2014/06/25::
44
Classical Encryption Techniques (CSS322, L3, Y14)
Classical Encryption Techniques (CSS322, L3, Y14)
DATE: 2015/01/21::
45
Kevin Slavin Those Algorithms That Govern Our Lives Video
Kevin Slavin Those Algorithms That Govern Our Lives Video
DATE: 2011/08/03::
46
ALGORITHMS - the trailer
ALGORITHMS - the trailer
DATE: 2012/10/03::
47
Introduction to Encryption Techniques (CSS322, Lecture 2, 2013)
Introduction to Encryption Techniques (CSS322, Lecture 2, 2013)
DATE: 2013/11/14::
48
[encrypted] Procedural Audio
[encrypted] Procedural Audio
DATE: 2014/08/12::
49
What About CrashPlan?
What About CrashPlan?
DATE: 2012/01/21::
50
Programming Interview: Analysis of Algorithm (Best case, Average case, Worst case)
Programming Interview: Analysis of Algorithm (Best case, Average case, Worst case)
DATE: 2013/04/05::
NEXT >>
RESULTS [51 .. 101]
From Wikipedia, the free encyclopedia
Jump to: navigation, search
IDEA
International Data Encryption Algorithm InfoBox Diagram.svg
An encryption round of IDEA
General
Designers Xuejia Lai and James Massey
Derived from PES
Successors MMB, MESH, Akelarre,
IDEA NXT (FOX)
Cipher detail
Key sizes 128 bits
Block sizes 64 bits
Structure Lai-Massey scheme
Rounds 8.5
Best public cryptanalysis
The key can be recovered with a computational complexity of 2126.1 using narrow bicliques. This attack is computationally faster than a full brute force attack, though not, as of 2013, computationally feasible.[1]

In cryptography, the International Data Encryption Algorithm (IDEA), originally called Improved Proposed Encryption Standard (IPES), is a symmetric-key block cipher designed by James Massey of ETH Zurich and Xuejia Lai and was first described in 1991. The algorithm was intended as a replacement for the Data Encryption Standard (DES). IDEA is a minor revision of an earlier cipher, Proposed Encryption Standard (PES).

The cipher was designed under a research contract with the Hasler Foundation, which became part of Ascom-Tech AG. The cipher was patented in a number of countries but was freely available for non-commercial use. The name “IDEA” is also a trademark. The last patents expired in 2012 and IDEA is now patent-free and thus free to use.[2][3]

IDEA was used in Pretty Good Privacy (PGP) v2.0, and was incorporated after the original cipher used in v1.0, BassOmatic, was found to be insecure.[4] IDEA is an optional algorithm in the OpenPGP standard.

Operation[edit]

IDEA operates on 64-bit blocks using a 128-bit key, and consists of a series of eight identical transformations (a round, see the illustration) and an output transformation (the half-round). The processes for encryption and decryption are similar. IDEA derives much of its security by interleaving operations from different groupsmodular addition and multiplication, and bitwise eXclusive OR (XOR) — which are algebraically "incompatible" in some sense. In more detail, these operators, which all deal with 16-bit quantities, are:

  • Bitwise eXclusive OR (denoted with a blue circled plus ).
  • Addition modulo 216 (denoted with a green boxed plus ).
  • Multiplication modulo 216+1, where the all-zero word (0x0000) in inputs is interpreted as 216 and 216 in output is interpreted as the all-zero word (0x0000) (denoted by a red circled dot ).

After the eight rounds comes a final “half round”, the output transformation illustrated below (the swap of the middle two values cancels out the swap at the end of the last round, so that there is no net swap):

International Data Encryption Algorithm InfoBox Diagram Output Trans.png

Structure[edit]

The overall structure of IDEA follows the Lai-Massey scheme. XOR is used for both subtraction and addition. IDEA uses a key-dependent half-round function. To work with 16 bit words (meaning four inputs instead of two for the 64 bit block size), IDEA uses the Lai-Massey scheme twice in parallel, with the two parallel round functions being interwoven with each other. To ensure sufficient diffusion, two of the sub-blocks are swapped after each round.

Key schedule[edit]

Each round uses six 16-bit sub-keys, while the half-round uses four, a total of 52 for 8.5 rounds. The first eight sub-keys are extracted directly from the key, with K1 from the first round being the lower sixteen bits; further groups of eight keys are created by rotating the main key left 25 bits between each group of eight. This means that it is rotated less than once per round, on average, for a total of six rotations.

Decryption[edit]

Decryption works like encryption, but the order of the round keys is inverted, and each value of subkeys K1 – K4 is replaced by its inverse for the respective group operation (K5 and K6 of each group should not be changed for decryption).

Security[edit]

The designers analysed IDEA to measure its strength against differential cryptanalysis and concluded that it is immune under certain assumptions. No successful linear or algebraic weaknesses have been reported. As of 2007, the best attack which applied to all keys could break IDEA reduced to 6 rounds (the full IDEA cipher uses 8.5 rounds).[5] Note that a "break" is any attack which requires less than 2128 operations; the 6-round attack requires 264 known plaintexts and 2126.8 operations.

Bruce Schneier thought highly of IDEA in 1996, writing, "In my opinion, it is the best and most secure block algorithm available to the public at this time." (Applied Cryptography, 2nd ed.) However, by 1999 he was no longer recommending IDEA due to the availability of faster algorithms, some progress in its cryptanalysis, and the issue of patents.[6]

In 2011 full 8.5-found IDEA was broken using a meet-in-the-middle attack.[7] Independently in 2012, full 8.5 round IDEA was broken using a narrow-bicliques attack, with a reduction of cryptographic strength of about two bits, similar to the effect of the previous bicliques attack on AES.[8]

Weak keys[edit]

The very simple key schedule makes IDEA subject to a class of weak keys; some keys containing a large number of 0 bits produce weak encryption.[9] These are of little concern in practice, being sufficiently rare that they are unnecessary to avoid explicitly when generating keys randomly. A simple fix was proposed: exclusive-ORing each subkey with a 16-bit constant, such as 0x0DAE.[9][10]

Larger classes of weak keys were found in 2002.[11]

This is still of negligible probability to be a concern to a randomly chosen key, and some of the problems are fixed by the constant XOR proposed earlier, but the paper is not certain if all of them are. A more comprehensive redesign of the IDEA key schedule may be desirable.[11]

Availability[edit]

A patent application for IDEA was first filed in Switzerland (CH A 1690/90) on May 18, 1990, then an international patent application was filed under the Patent Cooperation Treaty on May 16, 1991. Patents were eventually granted in Austria, France, Germany, Italy, the Netherlands, Spain, Sweden, Switzerland, the United Kingdom, (European Patent Register entry for European patent no. 0482154, filed May 16, 1991, issued June 22, 1994 and expired May 16, 2011), the United States (U.S. Patent 5,214,703, issued May 25, 1993 and expired January 7, 2012) and Japan (JP 3225440) (expired May 16, 2011).[12]

MediaCrypt AG is now offering a successor to IDEA and focuses on its new cipher (official release on May 2005) IDEA NXT, which was previously called FOX.

Literature[edit]

  • Hüseyin Demirci, Erkan Türe, Ali Aydin Selçuk, A New Meet in the Middle Attack on The IDEA Block Cipher, 10th Annual Workshop on Selected Areas in Cryptography, 2004.
  • Xuejia Lai and James L. Massey, A Proposal for a New Block Encryption Standard, EUROCRYPT 1990, pp389–404
  • Xuejia Lai and James L. Massey and S. Murphy, Markov ciphers and differential cryptanalysis, Advances in Cryptology — Eurocrypt '91, Springer-Verlag (1992), pp17–38.

References[edit]

  1. ^ http://www.cs.bris.ac.uk/eurocrypt2012/Program/Tues/Rechberger.pdf
  2. ^ "Espacenet - Bibliografische Daten" (in German). Worldwide.espacenet.com. Retrieved 2013-06-15. 
  3. ^ "Espacenet - Bibliografische Daten" (in German). Worldwide.espacenet.com. Retrieved 2013-06-15. 
  4. ^ Garfinkel, Simson (December 1, 1994), PGP: Pretty Good Privacy, O'Reilly Media, pp. 101–102, ISBN 978-1-56592-098-9 
  5. ^ Biham, E.; Dunkelman, O.; Keller, N. "A New Attack on 6-Round IDEA". Springer-Verlag. 
  6. ^ "Slashdot: Crypto Guru Bruce Schneier Answers". slashdot.org. Retrieved 2010-08-15. 
  7. ^ "New Attacks on IDEA with at Least 6 Rounds". 
  8. ^ Khovratovich, D.; Leurent, G.; Rechberger, C. "Narrow-Bicliques: Cryptanalysis of Full IDEA". Springer-Verlag.  (subscription required)
  9. ^ a b Daemen, Joan; Govaerts, Rene; Vandewalle, Joos (1993), "Weak Keys for IDEA", Advances in Cryptology, CRYPTO 93 Proceedings: 224–231 
  10. ^ Nakahara, Jorge Jr.; Preneel, Bart; Vandewalle, Joos (2002), A note on Weak Keys of PES, IDEA and some Extended Variants 
  11. ^ a b Biryukov, Alex; Nakahara, Jorge Jr.; Preneel, Bart; Vandewalle, Joos, "New Weak-Key Classes of IDEA" (PDF), Information and Communications Security, 4th International Conference, ICICS 2002, Lecture Notes in Computer Science 2513: 315–326, While the zero-one weak keys problem of IDEA can be corrected just by XORing a fixed constant to all the keys (one such constant may be 0DAEx as suggested in [4]) the problem with the runs of ones may still remain and will require complete redesign of the IDEA key schedule. 
  12. ^ "GnuPG 1.4.13 released". Werner Koch. Retrieved 2013-10-06. 

External links[edit]

Wikipedia content is licensed under the GFDL License
Powered by YouTube
MASHPEDIA
LEGAL
  • Mashpedia © 2015