Skip to content

Commit

Permalink
minor fixes in 4.5
Browse files Browse the repository at this point in the history
I inserted the line breaks in the frist algorithm because xml2rfc gave a warning that these lines were too long.
  • Loading branch information
kaiserd committed Jul 3, 2017
1 parent 9f23c4f commit f3d6267
Showing 1 changed file with 7 additions and 5 deletions.
12 changes: 7 additions & 5 deletions draft-ietf-dnssd-privacy.xml
Original file line number Diff line number Diff line change
Expand Up @@ -1111,11 +1111,13 @@ providing the names of the instances present in the scope.
</t>
<figure>
<artwork>
nonce = 24 bit rounded time stamp of the respective next time interval
nonce = 24 bit rounded time stamp of the\
respective next time interval
for each available pairing
retrieve the key Xj of pairing number j
compute F = first 48 bits of hash(nonce, Xj)
construct the binary instance_name as described in the previous section
construct the binary instance_name as described\
in the previous section
instance_names[nonce][instance_name] = Xj;
</artwork>
</figure>
Expand Down Expand Up @@ -1144,11 +1146,11 @@ of its available pairings, according to the following conceptual algorithm:
Check that the nonce matches the first 24 bits of
the current time, or the previous interval (24 bit number
minus 1) if the current interval is less than half over,
or the next interval ((24 bit number plus 1) if the
or the next interval (24 bit number plus 1) if the
current interval is more than half over. If the
nonce does not match an acceptable value, discard
the instance.
the instance.

if ((Xj = instance_names[nonce][instance_name]) != null)
mark the pairing number j as available
</artwork>
Expand Down

0 comments on commit f3d6267

Please sign in to comment.