* text/plain=txt<br>
     * application/rtf=rtf<br>
     * application/vnd.ms-htmlhelp=chm<br>
     * application/zip=zip<br>
     * application/x-7z-comressed=7z<br>
     * application/x-bzip=bz<br>
     * application/x-bzip2=bz2<br>
     * application/x-tar=tar<br>
     * application/x-rar-compressed=rar<br>
     * video/3gp=3gp<br>
     * video/3g2=3g2<br>
     * video/x-msvideo=avi<br>

larger prime power of each prime factor, so we can // right-shift the number with the fewest trailing zeros until it's odd. // For odd a, b and m >= n, lcm(a×2ᵐ, b×2ⁿ) = lcm(a×2ᵐ, b). az, bz := a.TrailingZeroBitsVarT(), b.TrailingZeroBitsVarT() if az < bz { a = a.ShiftRightVarTime(az) } else { b = b.ShiftRightVarTime(bz) } gcd, err := bigmod.NewNat().GCDVarTime(a, b) if err != nil { return nil, err } if gcd.IsOdd() == 0 { return nil, errors.New("rsa: internal error: gcd(a, b) is even") } // To avoid implementing...