Lines Matching refs:use

101 	he claims to use 280k of tables but the iteration calculation seems
102 	to use only 128k.  his tables and code are machine independent.
139 and knew that it used des,  so i figured i'd use its routines.  but once
147 movement (in particular, his use of L1, R1, L2, R2), and it was full of
157 the working data in TWO forms, one for easy use of half the sboxes in
158 indexing, the other for easy use of the other half; instead you can keep
159 it in the form for the first half and use a simple rotate to get the other
186    i always use unsigned char's if the high bit could be set.
205    ROR and ROL macros to use machine rotate instructions if you have them.
206    this will save 2 instructions and a temporary per use,
215    has rotates, as explained above in (3) (not necessary if you use gcc).
219    (it appears that gcc can use ebx, esi and edi to hold register variables).
221    and if you use ALL of them, use `scaled by 8' address modes with displacement
233 the en/decryption routines each use 6 necessary register variables,
238 i assume that the use of a constant is more expensive than using a register:
242 	greater than 127 in value (can't use movq or byte immediate on CISC)
243 	9-127 (may not be able to use CISC shift immediate or add/sub quick),
280 how to use the routines
303 	en/decryption with the key k. if you use DesMethod,
311 	you really shouldn't use the 768bit format directly;  i should
324 	Small|Quick determines whether you use the normal routine
344 to use these with kerberos or kerberos-compatible code put desCore.a