0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing

Not currently available

Anubis (Cipher) (Paperback) Loot Price: R880
Discovery Miles 8 800
Anubis (Cipher) (Paperback): Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow

Anubis (Cipher) (Paperback)

Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow

 (sign in to rate)
Loot Price R880 Discovery Miles 8 800 | Repayment Terms: R80 pm x 12*

Bookmark and Share

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

High Quality Content by WIKIPEDIA articles! Anubis is a block cipher designed by Vincent Rijmen and Paulo S. L. M. Barreto as an entrant in the NESSIE project. Anubis operates on data blocks of 128 bits, accepting keys of length 32N bits (N = 4, ..., 10). The cipher is not patented and has been released by the designers for free public use. Anubis is a Rijndael variant that uses involutions for the various operations. An involution is an operation whose inverse is the same as the forward operation. In other words, when an involution is run twice, it is the same as performing no operation. This allows low-cost hardware and compact software implementations to use the same operations for both encryption and decryption. Both the S-box and the mix columns operations are involutions.

General

Imprint: Betascript Publishing
Country of origin: United States
Release date: September 2010
First published: September 2010
Editors: Lambert M. Surhone • Mariam T. Tennoe • Susan F. Henssonow
Dimensions: 152 x 229 x 7mm (L x W x T)
Format: Paperback - Trade
Pages: 124
ISBN-13: 978-6132489654
Categories: Books > Computing & IT > General theory of computing > General
LSN: 6132489657
Barcode: 9786132489654

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners