<feed xmlns='http://www.w3.org/2005/Atom'>
<title>linux/include/crypto, branch v2.6.24-rc3</title>
<subtitle>Linux kernel source tree</subtitle>
<id>https://git.amat.us/linux/atom/include/crypto?h=v2.6.24-rc3</id>
<link rel='self' href='https://git.amat.us/linux/atom/include/crypto?h=v2.6.24-rc3'/>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/'/>
<updated>2007-10-10T23:55:50Z</updated>
<entry>
<title>[CRYPTO] sha: Add header file for SHA definitions</title>
<updated>2007-10-10T23:55:50Z</updated>
<author>
<name>Jan Glauber</name>
<email>jang@de.ibm.com</email>
</author>
<published>2007-10-09T14:43:13Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=5265eeb2b036835021591173ac64e624baaff55c'/>
<id>urn:sha1:5265eeb2b036835021591173ac64e624baaff55c</id>
<content type='text'>
There are currently several SHA implementations that all define their own
initialization vectors and size values. Since this values are idential
move them to a header file under include/crypto.

Signed-off-by: Jan Glauber &lt;jang@de.ibm.com&gt;
Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] blkcipher: Added blkcipher_walk_virt_block</title>
<updated>2007-10-10T23:55:48Z</updated>
<author>
<name>Herbert Xu</name>
<email>herbert@gondor.apana.org.au</email>
</author>
<published>2007-10-04T07:24:05Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=7607bd8ff03b8af5af887931318cb2bb20361856'/>
<id>urn:sha1:7607bd8ff03b8af5af887931318cb2bb20361856</id>
<content type='text'>
This patch adds the helper blkcipher_walk_virt_block which is similar to
blkcipher_walk_virt but uses a supplied block size instead of the block
size of the block cipher.  This is useful for CTR where the block size is
1 but we still want to walk by the block size of the underlying cipher.

Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] xts: XTS blockcipher mode implementation without partial blocks</title>
<updated>2007-10-10T23:55:45Z</updated>
<author>
<name>Rik Snel</name>
<email>rsnel@cube.dyndns.org</email>
</author>
<published>2007-09-19T12:23:13Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=f19f5111c94053ba4931892f5c01c806de33942e'/>
<id>urn:sha1:f19f5111c94053ba4931892f5c01c806de33942e</id>
<content type='text'>
XTS currently considered to be the successor of the LRW mode by the IEEE1619
workgroup. LRW was discarded, because it was not secure if the encyption key
itself is encrypted with LRW.

XTS does not have this problem. The implementation is pretty straightforward,
a new function was added to gf128mul to handle GF(128) elements in ble format.
Four testvectors from the specification
	http://grouper.ieee.org/groups/1619/email/pdf00086.pdf
were added, and they verify on my system.

Signed-off-by: Rik Snel &lt;rsnel@cube.dyndns.org&gt;
Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] aead: Add authenc</title>
<updated>2007-10-10T23:55:43Z</updated>
<author>
<name>Herbert Xu</name>
<email>herbert@gondor.apana.org.au</email>
</author>
<published>2007-08-30T08:24:15Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=3c09f17c3d11f3e98928f55b600e6de22f58017a'/>
<id>urn:sha1:3c09f17c3d11f3e98928f55b600e6de22f58017a</id>
<content type='text'>
This patch adds the authenc algorithm which constructs an AEAD algorithm
from an asynchronous block cipher and a hash.  The construction is done
by concatenating the encrypted result from the cipher with the output
from the hash, as is used by the IPsec ESP protocol.

The authenc algorithm exists as a template with four parameters:

	authenc(auth, authsize, enc, enckeylen).

The authentication algorithm, the authentication size (i.e., truncating
the output of the authentication algorithm), the encryption algorithm,
and the encryption key length.  Both the size field and the key length
field are in bytes.  For example, AES-128 with SHA1-HMAC would be
represented by

	authenc(hmac(sha1), 12, cbc(aes), 16)

The key for the authenc algorithm is the concatenation of the keys for
the authentication algorithm with the encryption algorithm.  For the
above example, if a key of length 36 bytes is given, then hmac(sha1)
would receive the first 20 bytes while the last 16 would be given to
cbc(aes).

Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] ablkcipher: Remove queue pointer from common alg object</title>
<updated>2007-10-10T23:55:41Z</updated>
<author>
<name>Herbert Xu</name>
<email>herbert@gondor.apana.org.au</email>
</author>
<published>2007-08-26T11:12:47Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=2de98e75449fc1c43d2fbb857668ae62d4f5eece'/>
<id>urn:sha1:2de98e75449fc1c43d2fbb857668ae62d4f5eece</id>
<content type='text'>
Since not everyone needs a queue pointer and those who need it can
always get it from the context anyway the queue pointer in the
common alg object is redundant.

Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] api: Add aead crypto type</title>
<updated>2007-10-10T23:55:39Z</updated>
<author>
<name>Herbert Xu</name>
<email>herbert@gondor.apana.org.au</email>
</author>
<published>2007-08-30T07:36:14Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=1ae978208e2ee9ba1b01d309164bc5e590cd242d'/>
<id>urn:sha1:1ae978208e2ee9ba1b01d309164bc5e590cd242d</id>
<content type='text'>
This patch adds crypto_aead which is the interface for AEAD
(Authenticated Encryption with Associated Data) algorithms.

AEAD algorithms perform authentication and encryption in one
step.  Traditionally users (such as IPsec) would use two
different crypto algorithms to perform these.  With AEAD
this comes down to one algorithm and one operation.

Of course if traditional algorithms were used we'd still
be doing two operations underneath.  However, real AEAD
algorithms may allow the underlying operations to be
optimised as well.

Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] api: Add crypto_ablkcipher_ctx_aligned</title>
<updated>2007-10-10T23:55:37Z</updated>
<author>
<name>Sebastian Siewior</name>
<email>sebastian@breakpoint.cc</email>
</author>
<published>2007-08-02T12:41:53Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=aa379a6ab17ff5b06552c52360ce6d9f8c7c209a'/>
<id>urn:sha1:aa379a6ab17ff5b06552c52360ce6d9f8c7c209a</id>
<content type='text'>
This is function does the same thing for ablkcipher that is done for
blkcipher by crypto_blkcipher_ctx_aligned(): it returns an aligned
address of the private ctx.

Signed-off-by: Sebastian Siewior &lt;sebastian@breakpoint.cc&gt;
Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] cryptd: Add software async crypto daemon</title>
<updated>2007-05-02T04:38:32Z</updated>
<author>
<name>Herbert Xu</name>
<email>herbert@gondor.apana.org.au</email>
</author>
<published>2007-04-16T10:49:20Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=124b53d020622ffa24e27406f2373d5a3debd0d3'/>
<id>urn:sha1:124b53d020622ffa24e27406f2373d5a3debd0d3</id>
<content type='text'>
This patch adds the cryptd module which is a template that takes a
synchronous software crypto algorithm and converts it to an asynchronous
one by executing it in a kernel thread.

Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] api: Do not remove users unless new algorithm matches</title>
<updated>2007-05-02T04:38:32Z</updated>
<author>
<name>Herbert Xu</name>
<email>herbert@gondor.apana.org.au</email>
</author>
<published>2007-04-08T11:31:36Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=a73e69965fa2647faa36caf40f4132b9c99d61fd'/>
<id>urn:sha1:a73e69965fa2647faa36caf40f4132b9c99d61fd</id>
<content type='text'>
As it is whenever a new algorithm with the same name is registered
users of the old algorithm will be removed so that they can take
advantage of the new algorithm.  This presents a problem when the
new algorithm is not equivalent to the old algorithm.  In particular,
the new algorithm might only function on top of the existing one.

Hence we should not remove users unless they can make use of the
new algorithm.

Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
<entry>
<title>[CRYPTO] api: Add async blkcipher type</title>
<updated>2007-05-02T04:38:31Z</updated>
<author>
<name>Herbert Xu</name>
<email>herbert@gondor.apana.org.au</email>
</author>
<published>2007-04-16T10:48:54Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=b5b7f08869340aa8cfa23303f7d195f161479592'/>
<id>urn:sha1:b5b7f08869340aa8cfa23303f7d195f161479592</id>
<content type='text'>
This patch adds the mid-level interface for asynchronous block ciphers.
It also includes a generic queueing mechanism that can be used by other
asynchronous crypto operations in future.

Signed-off-by: Herbert Xu &lt;herbert@gondor.apana.org.au&gt;
</content>
</entry>
</feed>
