Title

  Test IKEv2.EN.I.1.1.6.5: Sending Multiple Transforms for CHILD_SA
  Part A: Multiple Encryption Algorithms (ADVANCED)


Purpose

  To verify an IKEv2 device properly transmits IKE_AUTH request with multiple transforms
  for CHILD_SA.


References

  * [RFC 4306] - Sections 2.7 and 3.3


Test Setup

  * Network Topology
      Connect the devices according to the Common Topology.
  * Configuration
      In each part, configure the devices according to the following configuration.
IKE_AUTH exchanges Algorithms
Encryption Integrity ESN
Part A ENCR_3DES
ENCR_AES_CBC
AUTH_HMAC_SHA1_96 NoESN
  * Pre-Sequence and Cleanup Sequence
      IKEv2 on the NUT is disabled after each part.


Procedure

   NUT                  TN1
(End-Node)           (End-Node)
    |                    |
    |------------------->| IKE_SA_INIT request (HDR, SAi1, KEi, Ni)
    |                    | (Judgement #1)
    |<-------------------| IKE_SA_INIT Response (HDR, SAr1, KEr, Nr)
    |                    | (Packet #1)
    |                    |
    |------------------->| IKE_AUTH request (HDR, SK {IDi, AUTH, N, SAi2, TSi, TSr})
    |                    | (Judgement #2)
    |                    |
    V                    V
  
 N: USE_TRANSPORT_MODE  
Packet #1 See Common Packet #2
  Part A: Multiple Encryption Algorithms (ADVANCED)
       1. NUT starts to negotiate with TN1 by sending IKE_SA_INIT request including a SA payload
          as described above to the TN1.
       2. Observe the messages transmitted on Link A.
       3. NUT transmits an IKE_AUTH request including a SA payload as described above to the
          TN1.
       4. Observe the messages transmitted on Link A.


Observable Result

  Part A
    Step 2: Judgment #1
      The NUT transmits an IKE_SA_INIT request including "ENCR_3DES",
      "PRF_HMAC_SHA1", "AUTH_HMAC_SHA1_96" and "D-H group 2" as proposed
      algorithms.
  
    Step 4: Judgment #2
      The NUT transmits an IKE_AUTH request including "ENCR_3DES", "ENCR_AES_CBC",
      "AUTH_HMAC_SHA1_96" and "No Extended Sequence Numbers" as proposed algorithms.


Possible Problems

  * None.