AZJ,eACE,iBAAA,8BAGE,sBAAA,yCACE,MAAA,KACA,YAAA,EAAA,IAAA,EAAA,KAIJ,6BACE,iBAAA,qBACA,MAAA,KAZJ,kBACE,iBAAA,6BASA,gCACE,iBAAA,oBACA,MAAA,QAZJ,iBACE,iBAAA,6BAGE,wBAAA,2CACE,MAAA,KACA,YAAA,EAAA,IAAA,EAAA,KAIJ,+BACE,iBAAA,oBACA,MAAA,KAZJ,gBACE,iBAAA,+BASA,8BACE,iBAAA,sBACA,MAAA,QAZJ,eACE,iBAAA,4BAGE,sBAAA,yCACE,MAAA,KACA,YAAA,EAAA,IAAA,EAAA,KAIJ,6BACE,iBAAA,mBACA,MAAA,KAZJ,oBACE,iBAAA,8BAGE,2BAAA,8CACE,MAAA,KACA,YAAA,EAAA,IAAA,EAAA,KAIJ,kCACE,iBAAA,qBACA,MAAA,KAZJ,eACE,iBAAA,2BAGE,sBAAA,yCACE,MAAA,...

correct range and to match the specification. It's unfortunate // that we need to do a shift instead of a mask, but see the comment on // rightShift. // // These are the most dangerous lines in the package and maybe in the // library: a single bit of bias in the selection of nonces would likely // lead to key recovery, but no tests would fail. Look but DO NOT TOUCH. if excess := len(b)*8 - c.N.BitLen(); excess > 0 { // Just to be safe, assert that this only happens for the one curve that // doesn't...

correct range and to match the specification. It's unfortunate // that we need to do a shift instead of a mask, but see the comment on // rightShift. // // These are the most dangerous lines in the package and maybe in the // library: a single bit of bias in the selection of nonces would likely // lead to key recovery, but no tests would fail. Look but DO NOT TOUCH. if excess := len(b)*8 - c.N.BitLen(); excess > 0 { // Just to be safe, assert that this only happens for the one curve that // doesn't...