On 13/09/2019, 13:41, "Thomas Fossati" <[email protected]> wrote: > It seems to me that this might still be possible modulo > recurrent-certificate-adjust (rcp) being upper bounded by > recurrent-cert-validity (rcv), i.e., slightly changing the calculations > in 3.5 like this: > > notBefore = nrd[i] - predating > notAfter = min(nrd[i] + rcv, red) > > predating = max(predating_S, predating_C) > predating_S = f * rcv (.5 <= f < 1) > predating_C = max(rcp, rcv) ^^^ typo: min
IMPORTANT NOTICE: The contents of this email and any attachments are confidential and may also be privileged. If you are not the intended recipient, please notify the sender immediately and do not disclose the contents to any other person, use it for any purpose, or store or copy the information in any medium. Thank you. _______________________________________________ Acme mailing list [email protected] https://www.ietf.org/mailman/listinfo/acme
