Lines Matching refs:i

38 To more rapidly understand the code in this package, inspect desSmallFips.i
46 performance comparison to other available des code which i could
55 	this has the quickest encryption/decryption routines i've seen.
56 	since i was interested in fast des filters rather than crypt(3)
57 	and password cracking, i haven't really bothered yet to speed up
58 	the key setting routine. also, i have no interest in re-implementing
59 	all the other junk in the mit kerberos des library, so i've just
69 	improvements i had suggested to him, this package's
87 	of the optimizations which i did in my encryption routines.
92 	(at some point i may do the same in my package).  he also implements
98 	crypt function and i didn't feel like ripping it out and measuring
137 a while ago i wanted some des routines and the routines documented on sun's
138 man pages either didn't exist or dumped core.  i had heard of kerberos,
139 and knew that it used des,  so i figured i'd use its routines.  but once
140 i got it and looked at the code,  it really set off a lot of pet peeves -
143 (i.e. the author didn't sit down and think before coding),
149 speedups but which did obfuscate everything.  so i took the test data
152 a while later i ran across the great crypt(3) package mentioned above.
155 do the same - it was a trivial change from which i had been scared away
160 half.  this means i have (almost) half the data manipulation and half
162 to crypt(3) in his tables - i didn't check.
164 i'm glad that i implemented it the way i did, because this C version is
171 one thing i did not want to do was write an enormous mess
175 of what i didn't want to do; all their endedness-specific `optimizations'
178 considerations of some kind, and i have included some options
182 1) i assume everything is byte addressable, although i don't actually
184    i assume word pointers can be freely cast to and from char pointers.
186    i always use unsigned char's if the high bit could be set.
189    i assume sizeof(word) == 4 EVERYWHERE.
216 2) if your machine has less than 12 32-bit registers i doubt your compiler will
224    des_keymap, i.e., now the sbox # is the high part of the index and
226    since i have no way to conveniently test it i have not provided my
238 i assume that the use of a constant is more expensive than using a register:
239 a) additionally, i have tried to put the larger constants in registers.
247    do the arithmetic, so i assign these to explicit `m' register variables
250 i assume that indexing is cheaper or equivalent to auto increment/decrement,
254 i assume that addresses can be cheaply formed from two registers,
272 (the x bits are still there, i'm just emphasizing where the S boxes are).
311 	you really shouldn't use the 768bit format directly;  i should
342 note that i have included a kerberos-compatible interface in desUtil.c