AES is based on a design principle known as a substitution-permutation network, and is fast in both software and hardware.

AES is a variant of Rijndael which has a fixed block si e of !"# bits, and a ke$ si e of !"#, !%", or "&' bits. ($ contrast, the Rijndael specification per se is specified with block and ke$ si es that ma$ be an$ multiple of )" bits, both with a minimum of !"# and a maximum of "&' bits. AES operates on a *+* column-major order matrix of b$tes, termed the state, although some versions of Rijndael have a larger block si e and have additional columns in the state. ,ost AES calculations are done in a special finite field. -he ke$ si e used for an AES cipher specifies the number of repetitions of transformation rounds that convert the input, called the plaintext, into the final output, called the ciphertext. -he number of c$cles of repetition are as follows. 10 cycles of repetition for 128-bit keys. 12 cycles of repetition for 192-bit keys. 14 cycles of repetition for 256-bit keys. Each round consists of several processing steps, each containing four similar but different stages, including one that depends on the encr$ption ke$ itself. A set of reverse rounds are applied to transform ciphertext back into the original plaintext using the same encr$ption ke$.

High-le el !escription of the "lgorith# !. $eyE%p"nsion/round ke$s are derived from the cipher ke$

using Rijndael0s ke$ schedule. AES re1uires a separate !"#-bit round ke$ block for each round plus one more. 2. &niti"l'o(n! !. A!!'o(n!$ey/each b$te of the state is combined with a block of the round ke$ using bitwise xor. ). 'o(n!s
1.

Sub($tes/a non-linear substitution step where each b$te is replaced with another according to a lookup table.

". ShiftRows/a transposition step where the last three rows of the state are shifted c$clicall$ a certain number of steps. ). ,ix2olumns/a mixing operation which operates on the columns of the state, combining the four b$tes in each column. *. AddRound3e$ *. *in"l 'o(n! 4no ,ix2olumns5 !. Sub($tes ". ShiftRows ). AddRound3e$.

+S,* is an interior gatewa$ protocol that routes 6nternet 7rotocol 4675 packets solel$ within a single routing domain 4autonomous s$stem5. 6t gathers link state information from available routers and constructs a topolog$ map of the network. -he topolog$ determines the routing table presented to the 6nternet 8a$er which makes routing decisions based solel$ on the destination IP
address

found in 67

packets. 6n an 9S7: network, routers or s$stems within the same area maintain an identical link-state database that describes the topolog$ of the area. Each router or s$stem in the area generates its link-state database from the link-state advertisements 48SAs5 that it receives from all the other routers or s$stems in the same area and the 8SAs that itself generates. An 8SA is a packet that contains information about neighbors and path costs. (ased on the link-state database, each router or s$stem calculates a shortest-path spanning tree, with itself as the root, using the S7: algorithm. E-S.A'. ph"se -his is the first step of the link-state database exchange. -he two s$stems negotiate who is the master and who is the subordinate. E-/HA01E ph"se -he two s$stems exchange ;atabase ;escription packets to find out the 8SAs that the link-state database of each s$stem does not include. Each s$stem stores the 8SAs that are not included in its link-state database in the retransmission list. 2+A3&01 ph"se

Each s$stem sends 8ink State Re1uest packets to re1uest the neighbor 4the other s$stem in this example5 to send to it the entire 8SAs that were stored in the retransmission list during the E<2=A>?E phase. -he neighbor responds to the re1uest with the 8SAs in 8ink State @pdate packets. *422 ph"se Ahen the two s$stems finish exchanging 8SAs and their link-state databases are s$nchroni ed, adjacenc$ is established between the two s$stems. After adjacencies are established between all the routers or s$stems in an area, each router or s$stem in the area periodicall$ sends an 8SA to share its adjacencies or to report its state change. ($ comparing the established adjacencies with the 8SAs, routers or s$stems in the area can discover the area topolog$ changes and update their link-state databases accordingl$.