Home > Articles > Security > Network Security

IPSec Overview Part Three: Cryptographic Technologies

In part 3 of his five-part series on the Cisco implementation of IPSec, Andrew Mason describes the cryptographic component technologies used in IPSec.
Like this article? We recommend

Like this article? We recommend

IPSec Cryptographic Components

This article looks at the cryptographic component technologies used in IPSec.

Data Encryption Standard (DES) Encryption

DES encryption includes the following components:

  • Encryption and decryption algorithms

  • Matching shared secret keys on each peer

  • Input cleartext data to be encrypted

At the core of DES is the encryption algorithm:

  1. A shared secret key is input to the algorithm. Then cleartext data is fed into the algorithm in fixed-length blocks and is converted to cyphertext.

  2. The cyphertext is transmitted to the IPSec peer using ESP.

  3. The peer receives the ESP packet, extracts the cyphertext, runs it through the decryption algorithm, and outputs cleartext identical to that input on the encrypting peer.

Figure 1 shows the DES encryption algorithm in action. In this figure, a pre-shared key is in use.

Figure 1 DES encryption.

Diffie-Hellman Key Agreement

The Diffie-Hellman key agreement (D-H) is a public key encryption method that provides a way for two IPSec peers to establish a shared secret key that only they know, although they're communicating over an insecure channel.

With D-H, each peer generates a public and private key pair. The private key generated by each peer is kept secret and never shared. The public key is calculated from the private key by each peer and is exchanged over the insecure channel. Each peer combines the other's public key with its own private key, and computes the same shared secret number. The shared secret number is then converted into a shared secret key. The shared secret key is never exchanged over the insecure channel.

As Figure 2 shows, Diffie-Hellman key exchange is a complicated process. This adds to the effectiveness of the encryption algorithm.

Figure 2 Diffie-Hellman key agreement.

This is the Diffie-Hellman process:

  1. The D-H process starts with each peer generating a large prime integer (in this example, p and q). Each peer sends the other its prime integer over the insecure channel. For example, Peer A sends p to Peer B. Each peer then uses the p and q values to generate g, a primitive root of p.

  2. Each peer generates a private D-H key (peer A: XA, peer B: XB).

  3. Each peer generates a public D-H key. The local private key is combined with the prime number p and the primitive root g in each peer to generate a public key, YA for peer A and YB for peer B. The formula for peer A is YA = g ^ XA mod p; the formula for peer B is YB = g ^ XB mod p. The exponentiation is computationally expensive. The caret (^) character denotes exponentiation (g to the XA power); mod denotes modulus.

  4. The public keys YA and YB are exchanged in public.

  5. Each peer generates a shared secret number (ZZ) by combining the public key received from the opposite peer with its own private key. The formula for peer A is ZZ = YB ^ XA mod p. The formula for peer B is ZZ = (YA ^ XB ) mod p. The ZZ values are identical in each peer. Knowing p or g or the D-H public keys is not enough to guess or easily calculate the shared secret value—largely because of the difficulty in factoring large prime numbers.

  6. Shared secret keys are derived from the shared secret number ZZ for use by DES or HMACs.

    NOTE

    Each IPSec peer has three keys:

    • A private key that's kept secret and never shared. It's used to sign messages.

    • A public key that's shared. It's used by others to verify a signature.

    • A shared secret key that's used to encrypt data using an encryption algorithm (DES, MD5, and so on). The shared secret key is derived from Diffie-Hellman key generation.

Hashed Message Authentication Codes (HMAC)

The fundamental hash algorithms used by IPSec are the cryptographically secure Message Digest 5 (MD5) and Secure Hash Algorithm 1 (SHA-1) hash functions. Hashing algorithms have evolved into HMACs, which combine the proven security of hashing algorithms with additional cryptographic functions. The hash produced is encrypted with the sender's private key, resulting in a keyed checksum as output.

In Figure 3, the hash function takes as input the variable-length cleartext data that needs to be authenticated, and a private key. The private key length is the same as that of the output of the hash. The HMAC algorithm is run, with a resultant fixed-length checksum as output. This checksum value is sent with the message as a signature. The receiving peer runs an HMAC on the same message data that was input at the sender, using the same private key, and the resultant hash is compared with the received hash, which should match exactly.

Figure 3 Hashed Message Authentication Codes (HMAC).

HMAC-MD5-96

The HMAC-MD5-96 (also known as HMAC-MD5) encryption technique is used by IPSec to make sure that a message has not been altered. HMAC-MD5 uses the MD5 hash developed by Ronald Rivest of the Massachusetts Institute of Technology and RSA Data Security Incorporated, and is described in RFC 1321.

HMAC-MD5 uses a 128-bit secret key and produces a 128-bit authenticator value. This 128-bit value is truncated to the first 96 bits. Upon sending, the truncated value is stored within the authenticator field of AH or ESP-HMAC. Upon receipt, the entire 128-bit value is computed and the first 96 bits are compared to the value stored in the authenticator field.

MD5 alone has recently been shown to be vulnerable to collision-search attacks. This form of attack and other currently known weaknesses of MD5 do not compromise the use of MD5 within HMAC, however, as no known attacks against HMAC-MD5 have been proven. HMAC-MD5 is recommended where the superior performance of MD5 over SHA-1 is important.

HMAC-SHA-1-96

The HMAC-SHA-1-96 (also known as HMAC-SHA-1) encryption technique is also used by IPSec to make sure that a message has not been altered. HMAC-SHA-1 uses the SHA-1 specified in FIPS-190-1 combined with HMAC (as per RFC 2104), and is described in RFC 2404.

HMAC-SHA-1 uses a 160-bit secret key and produces a 160-bit authenticator value. This 160-bit value is truncated to the first 96 bits. Upon sending, the truncated value is stored within the authenticator field of AH or ESP-HMAC. Upon receipt, the entire 160-bit value is computed and the first 96 bits are compared to the value stored in the authenticator field.

SHA-1 is considered cryptographically stronger than MD5, yet it takes more CPU cycles to compute. HMAC-SHA-1 is recommended where the slightly superior security of SHA-1 over MD5 is important.

This brings us to the end of the third part of this five-part series of articles covering IPSec. Be sure to catch the next installment.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020