当前位置: 首页>>代码示例>>C#>>正文


C# BigInteger.ModDivInPlace方法代码示例

本文整理汇总了C#中Mono.Math.BigInteger.ModDivInPlace方法的典型用法代码示例。如果您正苦于以下问题:C# BigInteger.ModDivInPlace方法的具体用法?C# BigInteger.ModDivInPlace怎么用?C# BigInteger.ModDivInPlace使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在Mono.Math.BigInteger的用法示例。


在下文中一共展示了BigInteger.ModDivInPlace方法的3个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C#代码示例。

示例1: CalculatePasscodesPerBlock

 /// <summary>
 /// Because the PPPv3 spec says that individual passcodes can not
 /// cross crypto/counter boundaries we must calculate how many
 /// passcodes we can generate out of a given block of 128 bits
 /// </summary>
 /// <returns></returns>
 public int CalculatePasscodesPerBlock(int passcodeLength, int alphabetLength)
 {
     byte[] bits128 = { 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff };
     BigInteger allBits = new BigInteger(bits128);
     int charactersPerBlock = 0;
     while (allBits > alphabetLength)
     {
         allBits.ModDivInPlace(alphabetLength);
         charactersPerBlock++;
     }
     int codesPerBlock = charactersPerBlock / passcodeLength;
     return codesPerBlock;
 }
开发者ID:ErebusBat,项目名称:pppNET,代码行数:19,代码来源:PppV3Engine.cs

示例2: GetPasscode

        /// <summary>
        /// Calculates the passcode for the given index
        /// </summary>
        /// <param name="passcodeOrdinal"></param>
        /// <returns></returns>
        public string GetPasscode(BigInteger passcodeOrdinal)
        {
            if (passcodeOrdinal > Int128Max)
                throw new ArgumentOutOfRangeException("passcodeOrdinal", String.Format("Passcode Ordinals can not exceed 128 bits!", string.Empty));

            byte[] crypto = GetCryptoBlockForCounter(_sequenceKey, passcodeOrdinal);
            StringBuilder passcode = new StringBuilder(_passcodeLength);
            BigInteger working = new BigInteger(crypto);
            while (passcode.Length < _passcodeLength)
            {
                int index = working.ModDivInPlace(_alphabet.Count);
                passcode.Append(_alphabet[index]);
            }
            return passcode.ToString();
        }
开发者ID:ErebusBat,项目名称:pppNET,代码行数:20,代码来源:PppV3Engine.cs

示例3: CalculateMaxPasscodeLength

 /// <summary>
 /// Each passcode is generated from a seperate 128 bit crypto operation, meaning that
 /// passcodes can not exceed a certain length for a given alphabet.
 /// </summary>
 /// <param name="alphabetLength"></param>
 /// <returns></returns>
 public static int CalculateMaxPasscodeLength(int alphabetLength)
 {
     BigInteger allBits = new BigInteger(bits128);
     int blocks = 0;
     while (allBits > alphabetLength)
     {
         allBits.ModDivInPlace(alphabetLength);
         blocks++;
     }
     return blocks;
 }
开发者ID:ErebusBat,项目名称:pppNET,代码行数:17,代码来源:PppV3Engine.cs


注:本文中的Mono.Math.BigInteger.ModDivInPlace方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。