Implementing new algorithm questions
#3
> pws[gid].i[0]

No, "i" is an array of u32 values. As most hashes are processed as 32 bit integers (not 8 bit chars) it faster this way. You just have to make sure to handle the endianess of the algorithm correctly. From what I can see from the above code it's simply little endian. Also note that you have 4 chars per 32 bit integer not 1. Means i[0] has chars 0, 1, 2 and 3 of the password.


Messages In This Thread
RE: Implementing new algorithm questions - by atom - 10-06-2016, 05:45 PM