akwizgran created page: BSP

akwizgran
2015-04-01 10:24:12 +00:00
parent 44bffdaa54
commit aa80e8894e

@@ -68,7 +68,7 @@ If the sender starts sending a stream at time t according to the sender's clock,
Each stream starts with a pseudo-random tag, which is TAG_LEN bytes long. The recipient calculates the tag in advance and uses it to recognise which sender the stream comes from and which incoming header key should be used. Each stream starts with a pseudo-random tag, which is TAG_LEN bytes long. The recipient calculates the tag in advance and uses it to recognise which sender the stream comes from and which incoming header key should be used.
The tag for the i^th stream from the sender to the recipient in a given rotation period is the first TAG_LEN bytes of MAC(k, int(i)), where k is the sender's outgoing tag key. For simplicity we require that TAG_LEN <<= MAC_LEN. Streams are counted starting from zero in each rotation period. The tag for the i^th stream from the sender to the recipient in a given rotation period is the first TAG_LEN bytes of MAC(k, int(i)), where k is the sender's outgoing tag key. For simplicity we require that TAG_LEN &lt;= MAC_LEN. Streams are counted starting from zero in each rotation period.
> Implementation note: The current implementation uses TAG_LEN = 16. > Implementation note: The current implementation uses TAG_LEN = 16.