Lines Matching +full:multi +full:- +full:block
5 --------------------------------------------
14 filled with each, struct crypto_alg, must be considered -- see below
46 - crypto_register_algs() succeeds if and only if it successfully
51 non-bulk function crypto_register_alg() instead.
53 - crypto_unregister_algs() tries to unregister all the given
57 Single-Block Symmetric Ciphers [CIPHER]
58 ---------------------------------------
65 block at a time and there are no dependencies between blocks at all.
79 Struct cipher_alg defines a single block cipher.
84 during any of these are in-flight.
88 KEY ---. PLAINTEXT ---.
90 .cia_setkey() -> .cia_encrypt()
92 '-----> CIPHERTEXT
101 KEY1 --. PLAINTEXT1 --. KEY2 --. PLAINTEXT2 --.
103 .cia_setkey() -> .cia_encrypt() -> .cia_setkey() -> .cia_encrypt()
105 '---> CIPHERTEXT1 '---> CIPHERTEXT2
108 Multi-Block Ciphers
109 -------------------
113 This section describes the multi-block cipher transformation
114 implementations. The multi-block ciphers are used for transformations
121 The registration of multi-block cipher algorithms is one of the most
134 Struct blkcipher_alg defines a synchronous block cipher whereas struct
135 ablkcipher_alg defines an asynchronous block cipher.
137 Please refer to the single block cipher description for schematics of
138 the block cipher usage.
140 Specifics Of Asynchronous Multi-Block Cipher
152 --------------
189 during any of these are in-flight. Please note that calling .init()
195 I) DATA -----------.
197 .init() -> .update() -> .final() ! .update() might not be called
199 '----' '---> HASH
201 II) DATA -----------.-----------.
203 .init() -> .update() -> .finup() ! .update() may not be called
205 '----' '---> HASH
207 III) DATA -----------.
211 '---------------> HASH
219 KEY--. DATA--.
221 .setkey() -> .init() -> .update() -> .export() at all in this scenario.
223 '-----' '--> PARTIAL_HASH
225 ----------- other transformations happen here -----------
227 PARTIAL_HASH--. DATA1--.
229 .import -> .update() -> .final() ! .update() may not be called
231 '----' '--> HASH1
233 PARTIAL_HASH--. DATA2-.
235 .import -> .finup()
237 '---------------> HASH2
240 - call .init() and then (as many times) .update()
241 - _not_ call any of .final(), .finup() or .export() at any point in future
243 In other words implementations should mind the resource allocation and clean-up.