Play Video
1
DATA ENCRYPTION STANDARD (DES) netwinz
DATA ENCRYPTION STANDARD (DES) netwinz
::2011/06/17::
Play Video
2
string technologies project
string technologies project
::2010/12/12::
Play Video
3
Car Key Master CKM200 write key for Benz DAS2
Car Key Master CKM200 write key for Benz DAS2
::2014/03/07::
Play Video
4
How Powerful Are Algorithms? | Idea Channel | PBS Digital Studios
How Powerful Are Algorithms? | Idea Channel | PBS Digital Studios
::2014/01/08::
Play Video
5
Simplified DES Example (CSS322, Lecture 5, 2013)
Simplified DES Example (CSS322, Lecture 5, 2013)
::2013/11/26::
Play Video
6
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/12/09::
Play Video
7
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/11/09::
Play Video
8
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/10/07::
Play Video
9
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2012/05/04::
Play Video
10
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2012/01/10::
Play Video
11
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2012/12/24::
Play Video
12
How To Remove "computer blocked, data encrypted" virus (FBI Scam) In 6 Minutes
How To Remove "computer blocked, data encrypted" virus (FBI Scam) In 6 Minutes
::2013/05/24::
Play Video
13
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/10/30::
Play Video
14
NSA cracked most online encryption
NSA cracked most online encryption
::2013/09/14::
Play Video
15
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/10/05::
Play Video
16
Fundamentals of Next Generation Encryption
Fundamentals of Next Generation Encryption
::2012/11/08::
Play Video
17
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/12/19::
Play Video
18
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/11/10::
Play Video
19
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/10/01::
Play Video
20
Privacy Preserving Multi Keyword Ranked Search over Encrypted Cloud Data
Privacy Preserving Multi Keyword Ranked Search over Encrypted Cloud Data
::2013/12/25::
Play Video
21
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/11/08::
Play Video
22
Promat Video Identification Parade Software Demonstration
Promat Video Identification Parade Software Demonstration
::2014/03/03::
Play Video
23
Identification and Authentication - Information Security Lesson #2 of 12
Identification and Authentication - Information Security Lesson #2 of 12
::2014/03/07::
Play Video
24
Encryption Box on Security Accreditations and trusting UKFast with their Future
Encryption Box on Security Accreditations and trusting UKFast with their Future
::2013/11/26::
Play Video
25
How to remove Read to decrypt by Crypto algorithm Virus
How to remove Read to decrypt by Crypto algorithm Virus
::2013/12/22::
Play Video
26
Implementation of LZW Data Compression Algorithm using CUDA architecture
Implementation of LZW Data Compression Algorithm using CUDA architecture
::2013/05/22::
Play Video
27
3rd BIU Winter School on Cryptography: Broadcast encryption and traitor tracing - Dan Boneh
3rd BIU Winter School on Cryptography: Broadcast encryption and traitor tracing - Dan Boneh
::2013/05/09::
Play Video
28
Introduction to Encryption Techniques (CSS322, Lecture 2, 2013)
Introduction to Encryption Techniques (CSS322, Lecture 2, 2013)
::2013/11/14::
Play Video
29
DOWNLOAD GnuPG FULL VERSION FREE
DOWNLOAD GnuPG FULL VERSION FREE
::2011/11/10::
Play Video
30
How to remove Dirtydecrypt.exe /"File is encrypted" virus
How to remove Dirtydecrypt.exe /"File is encrypted" virus
::2013/07/08::
Play Video
31
Network Encryption: What You Need to Know
Network Encryption: What You Need to Know
::2011/05/04::
Play Video
32
ALGORITHMS - the trailer
ALGORITHMS - the trailer
::2012/10/03::
Play Video
33
Molecular Algorithms for Satisfiability
Molecular Algorithms for Satisfiability
::2012/10/11::
Play Video
34
Latest Edward Snowden documents reveal NSA has cracked common Internet encryption
Latest Edward Snowden documents reveal NSA has cracked common Internet encryption
::2013/10/06::
Play Video
35
International Journal of Chaos, Control, Modelling and Simulation (IJCCMS)
International Journal of Chaos, Control, Modelling and Simulation (IJCCMS)
::2013/07/29::
Play Video
36
Single-Database Private Information Retrieval from Fully Homomorphic Encryption
Single-Database Private Information Retrieval from Fully Homomorphic Encryption
::2013/04/24::
Play Video
37
Algorithmic Music in a Box [25c3]
Algorithmic Music in a Box [25c3]
::2013/01/28::
Play Video
38
DES Encryption using OpenSSL
DES Encryption using OpenSSL
::2012/02/01::
Play Video
39
NASA LOOSES International SPACE STATION Codes on STOLEN LAPTOP
NASA LOOSES International SPACE STATION Codes on STOLEN LAPTOP
::2012/03/03::
Play Video
40
Scanner Encryption
Scanner Encryption
::2013/08/22::
Play Video
41
German companies to automatically encrypt emails
German companies to automatically encrypt emails
::2013/08/09::
Play Video
42
Learn How Cleversafe
Learn How Cleversafe's Information Dispersal Technology Works
::2013/04/03::
Play Video
43
Simple Encryption Animation
Simple Encryption Animation
::2010/01/11::
Play Video
44
encryption تشفير قاعده البيانات
encryption تشفير قاعده البيانات
::2010/03/14::
Play Video
45
Zeus Crypter November 2012 Crypter ! 0_33 ! VB6 ! Bypass All Anti Virus
Zeus Crypter November 2012 Crypter ! 0_33 ! VB6 ! Bypass All Anti Virus
::2012/11/18::
Play Video
46
Marketing and Selling on Internet by Jay Hiatt ENV2
Marketing and Selling on Internet by Jay Hiatt ENV2
::2013/09/12::
Play Video
47
HAR 2009: Life or Death Cryptology 2/5
HAR 2009: Life or Death Cryptology 2/5
::2009/10/12::
Play Video
48
HAR 2009: Life or Death Cryptology 1/5
HAR 2009: Life or Death Cryptology 1/5
::2009/10/11::
Play Video
49
HAR 2009: Life or Death Cryptology 5/5
HAR 2009: Life or Death Cryptology 5/5
::2009/10/12::
Play Video
50
HAR 2009: Life or Death Cryptology 4/5
HAR 2009: Life or Death Cryptology 4/5
::2009/10/12::
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:

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 each subkey is replaced by its inverse for the respective group operation.

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 2012, full 8.5 round IDEA was finally 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.[7]

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.[8] 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.[8][9]

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

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.[10]

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 ).[11]

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". Proceedings of Fast Software Encryption, 2007, Lecture Notes in Computer Science. Springer-Verlag. 
  6. ^ "Slashdot: Crypto Guru Bruce Schneier Answers". slashdot.org. Retrieved 2010-08-15. 
  7. ^ Khovratovich, D.; Leurent, G.; Rechberger, C. "Narrow-Bicliques: Cryptanalysis of Full IDEA". Advances in Cryptology – EUROCRYPT 2012. Springer-Verlag. 
  8. ^ a b Daemen, Joan; Govaerts, Rene; Vandewalle, Joos (1993), "Weak Keys for IDEA", Advances in Cryptology, CRYPTO 93 Proceedings: 224–231 
  9. ^ Nakahara, Jorge Jr.; Preneel, Bart; Vandewalle, Joos (2002), A note on Weak Keys of PES, IDEA and some Extended Variants 
  10. ^ a b Biryukov, Alex; Nakahara, Jorge Jr.; Preneel, Bart; Vandewalle, Joos, "New Weak-Key Classes of IDEA", 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." 
  11. ^ "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
LEGAL
  • Mashpedia © 2014