Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7001761
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T20:50:39+00:00 2026-05-27T20:50:39+00:00

On the MD5 algorithm, four auxiliary funcions are defined by Rivest. Can someone tell

  • 0

On the MD5 algorithm, four auxiliary funcions are defined by Rivest. Can someone tell me where do they come frome?

Taken from the MD5’s RFC (http://www.ietf.org/rfc/rfc1321.txt):

We first define four auxiliary
functions that each take as input
three 32-bit words and produce as
output one 32-bit word.

F(X,Y,Z) = XY v not(X) Z
G(X,Y,Z) = XZ v Y not(Z)
H(X,Y,Z) = X xor Y xor Z
I(X,Y,Z) = Y xor (X v not(Z))

Thanks in advance.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-27T20:50:39+00:00Added an answer on May 27, 2026 at 8:50 pm

    They are not “functions” per se. If you are a beginner, I can understand why it’s confusing.
    Basically, simplest way I can tell you is, in MD5, there are steps where it shifts or rotates bits around.
    Such “modifiers” are usually implemented as macros, not functions. For the RFC they are defined as follows

    /* F, G, H and I are basic MD5 functions.
     */
    #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
    #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
    #define H(x, y, z) ((x) ^ (y) ^ (z))
    #define I(x, y, z) ((y) ^ ((x) | (~z)))
    

    Notice the description (copy-pasted by you) and the code:

    XY v not(X) Z -> (((x) & (y)) | ((~x) & (z)))

    If it looks “strange”, it’s just (x & y) | (~x & z): a regular bit and, another end where the first parameter is negated and a bit or between the 2 results.

    If you are REALLY curious about what it all does, start a project in debug mode and MD5 a string and watch the magic in the autos and locals windows (for MSVS).

    Keep in mind, NOTHING stops you from using inlined functions instead if you so desire.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I am studying MD5 algorithm. I found out that there are four state variables
Does anybody know of ruby implementation of RSA Data Security, Inc. MD5 Message-Digest Algorithm
Is there any specific algorithm for the encoding and decoding MD5. Kindly give me
Which is the best overall hashing algorithm in terms of complexity and security? md5
Possible Duplicate: How come MD5 hash values are not reversible? I was reading a
I need an algorithm that can do a one-to-one mapping (ie. no collision) of
Im trying to use the md5 algorithm on web pages to avoid seeing duplicates.
I need to hash with md5 algorithm a string in my program. There is
I know that this might be a long stretch, but could someone possibly tell
we use md5 as a hashing algorithm in many parts of our code. security

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.