Ok, guys, I'm going to sleep now :) Before I go, I want to quickly explain to all those following this without understanding chit what's about; the authority port, the world internet authorithy (port 53) runs a trellis encryption; trellis is a 3 D system of geometric figures, where each vector of the 3D has a lapse of time (TTL) until can be shut off (like gmail which only can be reopened in 300 seconds) and a velocity of bites running on diffrent paths of volume (packets) , however (this is called convunational) trellis has a file i.cnm which has a task to forward, retransmit and reset all data traffic on world internet; what I've been doing was to use the forwrd aspect, which on the last code I published is about to reverse the lenght (firewall) , when we reverse the trellis path we are making possible a forward pool; this means that this is is the midlea aspect of shutting down worldwide internet. So, I'll be here tomorrow God's wishing; and He does. see u bye bye.

1 

30 #include <itpp/base/matfunc.h>

31 #include <itpp/base/algebra/schur.h>

32 #include <itpp/base/converters.h>

33 #include

34 

36 

37 namespace itpp

38 {

39 

40 // Square root of a square matrix (based on Octave sqrtm implementation)

41 cmat sqrtm(const mat& A)

42 {

43  return sqrtm(to_cmat(A));

44 }

45 

46 // Square root of the complex square matrix A

47 cmat sqrtm(const cmat& A)

48 {

49  cmat U, T;

50  schur(A, U, T);

51 

52  int n = U.rows();

53  cmat R(n, n);

54 

55  R.zeros();

56  for (int j = 0; j < n; j++)

57  R(j, j) = std::sqrt(T(j, j));

58 

59  const double fudge = std::sqrt(std::numeric_limits::min());

60 

61  for (int p = 0; p < n - 1; p++) {

62  for (int i = 0; i < n - (p + 1); i++) {

63  const int j = i + p + 1;

64  std::complex s = T(i, j);

65 

66  for (int k = i + 1; k < j; k++)

67  s -= R(i, k) * R(k, j);

68 

69  const std::complex d = R(i, i) + R(j, j) + fudge;

70  const std::complex conj_d = conj(d);

71 

72  R(i, j) = (s * conj_d) / (d * conj_d);

73  }

74  }

75 

76  return U * R * U.H();

77 }

78 

79 

80 bool all(const bvec &testvec)

81 {

82  for (int i = 0; i < testvec.length(); i++)

83  if (!testvec(i)) return false;

84  return true;

85 }

86 

87 bool any(const bvec &testvec)

88 {

89  for (int i = 0; i < testvec.length(); i++)

90  if (testvec(i)) return true;

91  return false;

92 }

Convert convolutional code polynomials to trellis description

http://www.mathworks.com/help/comm/ref/poly2trellis.html 

DNSSEC: Does the algorithm of the ZSK need to match the algorithm of the KSK?

Is it legal with DNSSEC to have differing algorithms for the ZSK and KSK? If so, how can I sign verify the zone using the standard bind DNSSEC tools with such a configuration?

...

 Well, as much as the tools complain about it, it does appear to work: dig voria.net +dnssec +multi isn't giving me any errors.

http://security.stackexchange.com/questions/80493/dnssec-does-the-algorithm-of-the-zsk-need-to-match-the-algorithm-of-the-ksk 


 

kernel, ok, microvolts code here so you don't need clusters you need a microvolt regulator

https://kernel.googlesource.com/pub/scm/linux/kernel/git/broonie/regulator/+/regulator-v4.0-rc2%5E3..regulator-v4.0-rc2/ 

ICANN selected seven people to be key holders and gave each one an actual key to Internet. It selected seven more people to be backup keyholders: so total 14 people. The physical keys unlock safety deposit boxes stashed around the world. Inside those boxes, there are smart key cards. If they all combine seven smart key cards together then they will have the “master key.” The master key may be a computer code or a password that can be used to access the ICANN database.

ICANN has released the list of trusted community representatives who will participate in the root key generation and signing ceremonies, the first of which will take place tomorrow, June 16, in Culpeper, Virginia.  (An FAQ on the trusted community representatives can be found here.)  Following is the complete list, although ICANN notes that backups may be called in if needed:
Crypto Officers for the US East Coast Facility

• Alain Aina, BJ
• Anne-Marie Eklund Löwinder, SE
• Federico Neves, BR
• Gaurab Upadhaya, NP
• Olaf Kolkman, NL
• Robert Seastrom, US
• Vinton Cerf, US

Crypto Officers for the US West Coast Facility

• Andy Linton, NZ
• Carlos Martinez, UY
• Dmitry Burkov, RU
• Edward Lewis, US
• João Luis Silva Damas, PT
• Masato Minda, JP
• Subramanian Moonesamy, MU

Recovery Key Share Holders

• Bevil Wooding, TT
• Dan Kaminsky, US
• Jiankang Yao, CN
• Moussa Guebre, BF
• Norm Ritchie, CA
• Ondřej Surý, CZ
• Paul Kane, UK

Backup Crypto Officers

• Christopher Griffiths, US
• Fabian Arbogast, TZ
• John Curran, US
• Nicolas Antoniello, UY
• Rudolph Daniel, UK
• Sarmad Hussain, PK
• Ólafur Guðmundsson, IS

Backup Recovery Key Share Holders

• David Lawrence, US
• Dileepa Lathsara, LK
• Jorge Etges, BR
• Kristian Ørmen, DK
• Ralf Weber, DE
• Warren Kumari, US

SEGI ren auziaren aurkako ekimena

How to start a fire with water

Fish - Credo - Internal Exile

Ophcrack windows password cracking example how it works on windows 7 pas...

Fast NTLM hash cracking with rainbow tables and RainbowCrack for GPU

Hash Cracking with Rainbow Tables

This document explains the rcrack program. The rcrack program lookup existing rainbow tables for the plaintext of user supplied hash.
Six similar programs are available:

http://project-rainbowcrack.com/crack.htm 

HashKiller.co.uk allows you to input an NTLM hash and search for its decrypted state in our database, basically, it's a NTLM cracker / decryption tool.

We have a total of just over 312.072 billion unique decrypted NTLM hashes since August 2007.
Please input the NTLM hashes that you would like to be converted into text / cracked / decrypted. NOTE that space character is replaced with [space]:
Please note the password is after the : character, and the NTLM hash is before it.

https://hashkiller.co.uk/ntlm-decrypter.aspx 

Free Password Hash Cracker

Enter up to 20 non-salted hashes, one per line:

Supports: LM, NTLM, md2, md4, md5, md5(md5_hex), md5-half, sha1, sha224, sha256, sha384, sha512, ripeMD160, whirlpool, MySQL 4.1+ (sha1(sha1_bin))

Download CrackStation's Wordlist

How CrackStation Works

CrackStation uses massive pre-computed lookup tables to crack password hashes. These tables store a mapping between the hash of a password, and the correct password for that hash. The hash values are indexed so that it is possible to quickly search the database for a given hash. If the hash is present in the database, the password can be recovered in a fraction of a second. This only works for "unsalted" hashes. For information on password hashing systems that are not vulnerable to pre-computed lookup tables, see our hashing security page.
Crackstation's lookup tables were created by extracting every word from the Wikipedia databases and adding with every password list we could find. We also applied intelligent word mangling (brute force hybrid) to our wordlists to make them much more effective. For MD5 and SHA1 hashes, we have a 190GB, 15-billion-entry lookup table, and for other hashes, we have a 19GB 1.5-billion-entry lookup table.
You can download CrackStation's dictionaries here, and the lookup table implementation (PHP and C) is available here. 

https://crackstation.net/