Chris Calderon
Chris Calderon
``` chris@chris-H87H3-M3:~/Shallot$ ./shallot ^job4btc --------------------------------------------------------------------- Found matching domain after 29032965725 tries: job4btcwcxvgegqo.onion --------------------------------------------------------------------- -----BEGIN RSA PRIVATE KEY----- MIICXgIBAAKBgQC/TZKqlfK8tJsQxECtyTUtFAkUguUqksAGSXSPocJRqndpfbsG pOFBmfQIJpMF/StoF4zDzFK2lgRXjuSp68o0a0BQ90LKqaKRLTDhD650lvcb/iha 769+kZmgBOle8uoL89l74nEQPpc8c4zypjjASrZqvYBFNeOcZ+Uz1qhRyQIFA3BM VccCgYAGZeRTmgXpqVM1xUYJvOrv717HTYsXnsa15VVpjUqOiUAw13inzP3Sy6hL 7XmPo2h80CLyyYdpcFF8EZCWYkeMovBbmOfcFge9DrcjUwBettBgMsoaFzCVx0MY 95sxGlMQr052ccGLx4gNwH/iXKUMubwioTgVk3sIJMo8fHARlwJBAOwgSuG/STW1 w0Vq8WjMlbK45hkVMbW4FG3dpQ2giobGTZeM1akTYpnqsR1WRf1D8XlNH3/3syHf LQGH95VZhu0CQQDPZ377jfMjKvFjNFgk9b0mFN6L0VIVrLTv1u0ZJLFmxpmLxTiL jduMxdDXWCTCAK4GOwT3EPX4TWWgNTzwVZ7NAkBz0rfGwUDGux2v5YmWeVuGdgCT EuAL1Tb97xPWCfljuBqkS855C1TRpQJdP3Drr4uqwCMt120QdpVxczJbzayDAkEA rCShUJP/QGKLvy5958Kvg6Y8vvw0EgNJ/k20xJr+WoT3qvsNW7gw2lZABwUVrcCI Qf9+EM3JU0QGT+MxSaA61wJAUCax0YWk5a+3F5zp8WwqkQCGsNPvF6pJ8Pkrw0Kw +n52FqmBRashRyHneC6u+pZlBbSRhCJGs6wKdVeP2ltVsg==...
I noticed that int_pow in the math.c file uses the O(n) obvious algorithm or computing pow instead of the method of repeated squaring, which is O(log(n)). Is there any reason...
I was browsing the source when I noticed int_pow. First, I didn't like that it uses the simple linear algorithm. Second, it is only used twice, in the thread file,...