Lines Matching +full:50 +full:k

62   - 30us per encryption (options: 64k tables, no IP/FP)
63   - 33us per encryption (options: 64k tables, FIPS standard bit ordering)
64   - 45us per encryption (options:  2k tables, no IP/FP)
65   - 48us per encryption (options:  2k tables, FIPS standard bit ordering)
66   - 275us to set a new key (uses 1k of key tables)
80   - 53us per encryption (uses 2k of tables)
81   - 96us to set a new key (uses 2.25k of key tables)
97 	gcc 2.1 -O2	Sun 4/50	 48  uS	 53.4uS	 57.5uS	 11%
98 	cc      -O2	Sun 4/50	 48  uS	 64.6uS	 64.7uS	 35%
99 	cc      -O4	Sun 4/50	 48  uS	 64.7uS	 64.9uS	 35%
106    - 68us per encryption (uses 2k of tables)
107    - 96us to set a new key (uses 2.25k of key tables)
125 	des iteration; above, Quick (64k) takes 21 and Small (2k) takes 37.
126 	he claims to use 280k of tables but the iteration calculation seems
127 	to use only 128k.  his tables and code are machine independent.
133   - 108us per encryption (uses 34k worth of tables)
134   - 134us to set a new key (uses 32k of key tables to get this speed!)
146 	also very modified for crypt.  his iteration code uses 16k
153   - 165us per encryption (uses 6k worth of tables)
154   - 478us to set a new key (uses <1k of key tables)
297 this assumption is reversed for 68k and vax.
343 	it generates the special 64k table these routines need.
347 DesMethod(m, k)
348 	m points to a 128byte block, k points to an 8 byte des key
353 	m is filled in from k so that when one of the routines below
355 	en/decryption with the key k. if you use DesMethod,
384 	or the crazy quick one which gobbles up 64k more of memory.
385 	Small is 50% slower then Quick, but Quick needs 32 times as much