# Integrated Encryption Scheme

Integrated Encryption Scheme (IES) is a hybrid encryption scheme which provides semantic security against an adversary who is able to use chosen-plaintext or chosen-ciphertext attacks. The security of the scheme is based on the computational Diffie–Hellman problem.
Two variants of IES are specified: Discrete Logarithm Integrated Encryption Scheme (DLIES) and Elliptic Curve Integrated Encryption Scheme (ECIES), which is also known as the Elliptic Curve Augmented Encryption Scheme or simply the Elliptic Curve Encryption Scheme. These two variants are identical up to the change of an underlying group[clarification needed].

## Informal description of DLIES

As a brief and informal description and overview of how IES works, a Discrete Logarithm Integrated Encryption Scheme (DLIES) is used, focusing on illuminating the reader's understanding, rather than precise technical details.

1. Alice learns Bob's public key $g^{x}$ through a public key infrastructure or some other distribution method.
Bob knows his own private key $x$ .
2. Alice generates a fresh, ephemeral value $y$ , and its associated public value $g^{y}$ .
3. Alice then computes a symmetric key $k$ using this information and a key derivation function (KDF) as follows: $k={\textrm {KDF}}(g^{xy})$ 4. Alice computes her ciphertext $c$ from her actual message $m$ (by symmetric encryption of $m$ ) encrypted with the key $k$ (using an authenticated encryption scheme) as follows: $c=E(k;m)$ 5. Alice transmits (in a single message) both the public ephemeral $g^{y}$ and the ciphertext $c$ .
6. Bob, knowing $x$ and $g^{y}$ , can now compute $k={\textrm {KDF}}(g^{xy})$ and decrypt $m$ from $c$ .

Note that the scheme does not provide Bob with any assurance as to who really sent the message: This scheme does nothing to stop anyone from pretending to be Alice.

## Formal description of ECIES

### Required information

To send an encrypted message to Bob using ECIES, Alice needs the following information:

• The cryptography suite to be used, including a key derivation function (e.g., ANSI-X9.63-KDF with SHA-1 option), a message authentication code (e.g., HMAC-SHA-1-160 with 160-bit keys or HMAC-SHA-1-80 with 80-bit keys) and a symmetric encryption scheme (e.g., TDEA in CBC mode or XOR encryption scheme) — noted $E$ .
• The elliptic curve domain parameters: $(p,a,b,G,n,h)$ for a curve over a prime field or $(m,f(x),a,b,G,n,h)$ for a curve over a binary field.
• Bob's public key $K_{B}$ , which Bob generates it as follows: $K_{B}=k_{B}G$ , where $k_{B}\in [1,n-1]$ is the private key he chooses at random.
• Some optional shared information: $S_{1}$ and $S_{2}$ • $O$ which denotes the point at infinity.

### Encryption

To encrypt a message $m$ Alice does the following:

1. generates a random number $r\in [1,n-1]$ and calculates $R=rG$ 2. derives a shared secret: $S=P_{x}$ , where $P=(P_{x},P_{y})=rK_{B}$ (and $P\neq O$ )
3. uses a KDF to derive symmetric encryption keys and MAC keys: $k_{E}\|k_{M}={\textrm {KDF}}(S\|S_{1})$ 4. encrypts the message: $c=E(k_{E};m)$ 5. computes the tag of encrypted message and $S_{2}$ : $d={\textrm {MAC}}(k_{M};c\|S_{2})$ 6. outputs $R\|c\|d$ ### Decryption

To decrypt the ciphertext $R\|c\|d$ Bob does the following:

1. derives the shared secret: $S=P_{x}$ , where $P=(P_{x},P_{y})=k_{B}R$ (it is the same as the one Alice derived because $P=k_{B}R=k_{B}rG=rk_{B}G=rK_{B}$ ), or outputs failed if $P=O$ 2. derives keys the same way as Alice did: $k_{E}\|k_{M}={\textrm {KDF}}(S\|S_{1})$ 3. uses MAC to check the tag and outputs failed if $d\neq {\textrm {MAC}}(k_{M};c\|S_{2})$ 4. uses symmetric encryption scheme to decrypt the message $m=E^{-1}(k_{E};c)$ 