Thursday, March 2, 2017

we need this cookie ...I'll see it better tomorrow

package org.apache.directory.server.ntp.messages;
22  
23  
24  import java.util.Arrays;
25  import java.util.Collections;
26  import java.util.List;
27  
28  
29  /**
30   * Reference Identifier: This is a 32-bit bitstring identifying the
31   * particular reference source. In the case of NTP Version 3 or Version
32   * 4 stratum-0 (unspecified) or stratum-1 (primary) servers, this is a
33   * four-character ASCII string, left justified and zero padded to 32
34   * bits. In NTP Version 3 secondary servers, this is the 32-bit IPv4
35   * address of the reference source. In NTP Version 4 secondary servers,
36   * this is the low order 32 bits of the latest transmit timestamp of the
37   * reference source. NTP primary (stratum 1) servers should set this
38   * field to a code identifying the external reference source according
39   * to the following list. If the external reference is one of those
40   * listed, the associated code should be used. Codes for sources not
41   * listed can be contrived as appropriate.

http://directory.apache.org/apacheds/gen-docs/2.0.0-M9/xref/org/apache/directory/server/ntp/messages/ReferenceIdentifier.html

Elsa David this chit works on every fuckin' frequency Hacker Anonymous Việt Nam

Deciphering a key from XOR encrypted cypher using boolean logic

following the white rabbit direct to cables i have this hotdog ..because xor is the base of all hardware encryption 



Elsa David of course i know we're talking about optic tronics


If K is random and you only know A or B (but not both) then, no, there is no way to infer anything about the key - this is the (in)famous one-time-pad.
If you know A and B, then you can recover K very easily. Exclusive-or has those properties:
  • n    nn=0
  • n    n0=n (identity element)
  • a,b    ab=ba (commutativity)
  • a,b,c    abc=(ab)c=a(bc) (associativity)
So we can do the following:
B=AK      AB=A(AK)=(AA)K=0K=K
So AB=K
Viewed differently, the exclusive-or operator is invertible:
01001110
AB000011101110
And since the truth table is symmetric, the exclusive-or operation just happens to be its own inverse, i.e. x1y=xy. So if we take our original equation:
AK=B
We can represent it as follows:
KA=B
And we can then undo (invert) the exclusive-or by A:
KA1A=B1A      K=B1A
And as we found above, this is identical to:
K=BA=AB
As found at the beginning.
However, this is assuming A, B and K are all the same length. If K is smaller than A and B, then it means that K will be used multiple times (repeated over the length of the plaintext, presumably). This repetition can be exploited to successfully recover K from only B provided there is enough repetition and there is enough ciphertext to work with - see Vigenere cipher.

Cielo e terra (duet with Dante Thomas)