在我正在编写的程序中,我正在进行大量的字符串操作.我正在努力提高性能,我想知道使用char数组是否会显示出不错的性能提升.有什么建议？
我正在使用BigIntegers在Java中实现DES加密.
我通过执行BigInteger.leftShift(int n)方法将Java二进制密钥与Java BigIntegers一起移位.N(Kn)的关键取决于Kn-1的移位结果.我得到的问题是,我在生成每个密钥后打印出结果,并且转移不是预期的输出.密钥分为2 Cn和Dn(分别为左和右).
我特意尝试这个:"要进行左移,将每个位移到左边一个位置,除了第一个位,循环到块的末尾."
根据转变,似乎最终会对O进行攻击.不知道如何纠正这个问题.
结果:
c0:11110101010100110011000011110
d0:11110001111001100110101010100
c1:111101010101001100110000111100
d1:111100011110011001101010101000
c2:11110101010100110011000011110000
d2:11110001111001100110101010100000
c3:1111010101010011001100001111000000
d3:1111000111100110011010101010000000
c4:111101010101001100110000111100000000
d4:111100011110011001101010101000000000
c5:11110101010100110011000011110000000000
d5:11110001111001100110101010100000000000
c6:1111010101010011001100001111000000000000
d6:1111000111100110011010101010000000000000
c7:111101010101001100110000111100000000000000
d7:111100011110011001101010101000000000000000
c8:1111010101010011001100001111000000000000000
d8:1111000111100110011010101010000000000000000
c9:111101010101001100110000111100000000000000000
d9:111100011110011001101010101000000000000000000
c10:11110101010100110011000011110000000000000000000
d10:11110001111001100110101010100000000000000000000
c11:1111010101010011001100001111000000000000000000000
d11:1111000111100110011010101010000000000000000000000
c12:111101010101001100110000111100000000000000000000000
d12:111100011110011001101010101000000000000000000000000
c13:11110101010100110011000011110000000000000000000000000
d13:11110001111001100110101010100000000000000000000000000
c14:1111010101010011001100001111000000000000000000000000000
d14:11110001111001100110101010100000000000000000000000000000000
c15:11110101010100110011000011110000000000000000000000000000
d15:111100011110011001101010101000000000000000000000000000000000