Zig 0.17.0-dev (Split by item) This is an example of documentation generated by
ZigDoc , an alternative to Zig's built-in
Auto Doc feature. See also
examples in other modes/formats . The project being documented here (as the example) is the Zig standard library.
std › crypto › ff › Modulus › powWithEncodedExponentInternal Private Function powWithEncodedExponentInternal Doc Source Private Function std.crypto.ff.Modulus.powWithEncodedExponentInternal
fn powWithEncodedExponentInternal (self : Self , x : Fe , e : []const u8 , endian : Endian , comptime public : bool ) NullExponentError !Fe Params Errors File crypto/ff.zig: 695
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792 fn powWithEncodedExponentInternal (self : Self , x : Fe , e : []const u8 , endian : Endian , comptime public : bool ) NullExponentError !Fe {
var acc : u8 = 0 ;
for (e ) |b | acc |= b ;
if (acc == 0 ) return error .NullExponent ;
const was_montgomery = x .montgomery ;
var out = self .one ();
self .toMontgomery (&out ) catch unreachable ;
if (public and
(e .len < 3 or (e .len == 3 and e [if (endian == .big ) 0 else 2 ] <= 0b1111 )))
{
// Do not use a precomputation table for short, public exponents
var x_m = x ;
if (!x .montgomery ) {
self .toMontgomery (&x_m ) catch unreachable ;
}
var s = switch (endian ) {
.big => 0 ,
.little => e .len - 1 ,
};
while (true ) {
const b = e [s ];
var j : u3 = 7 ;
while (true ) : (j -= 1 ) {
out = self .montgomerySq (out );
const k : u1 = @truncate (b >> j );
if (k != 0 ) {
const t = self .montgomeryMul (out , x_m );
@memcpy (out .v .limbs (), t .v .limbsConst ());
}
if (j == 0 ) break ;
}
switch (endian ) {
.big => {
s += 1 ;
if (s == e .len ) break ;
},
.little => {
if (s == 0 ) break ;
s -= 1 ;
},
}
}
} else {
// Use a precomputation table for large exponents
var pc : [15 ]Fe = [1 ]Fe {x } ++ @as ([14 ]Fe , @splat (self .zero ));
if (!x .montgomery ) {
self .toMontgomery (&pc [0 ]) catch unreachable ;
}
for (1 ..pc .len ) |i | {
pc [i ] = self .montgomeryMul (pc [i - 1 ], pc [0 ]);
}
var t0 = self .zero ;
var s = switch (endian ) {
.big => 0 ,
.little => e .len - 1 ,
};
while (true ) {
const b = e [s ];
for ([_ ]u3 { 4 , 0 }) |j | {
for (0 ..4 ) |_ | {
out = self .montgomerySq (out );
}
const k = (b >> j ) & 0b1111 ;
if (public or std .options .side_channels_mitigations == .none ) {
if (k == 0 ) continue ;
t0 = pc [k - 1 ];
} else {
for (pc , 0 ..) |t , i | {
t0 .v .cmov (ct .eql (k , @as (u8 , @truncate (i + 1 ))), t .v );
}
}
const t1 = self .montgomeryMul (out , t0 );
if (public ) {
@memcpy (out .v .limbs (), t1 .v .limbsConst ());
} else {
out .v .cmov (!ct .eql (k , 0 ), t1 .v );
}
}
switch (endian ) {
.big => {
s += 1 ;
if (s == e .len ) break ;
},
.little => {
if (s == 0 ) break ;
s -= 1 ;
},
}
}
}
if (!was_montgomery ) {
self .fromMontgomery (&out ) catch unreachable ;
}
return out ;
}
Returns x^e (mod m), with the exponent provided as a byte string.
publicmust be set tofalseif the exponent it secret.