Category Archives: webid

  signup using chrome (not IE) to get a (windows) cert   create microblog and channel, and first post.   in IE metro mode, note how to login to site       after a second prompt to select the … Continue reading →

See http://aspnet.codeplex.com/SourceControl/changeset/view/1acc79fbc998#Samples%2fNet4%2fCS%2fWebApi%2fClientCertificateSample%2fCustomCertificateMessageHandler.cs Hmm. While this shows client certs driving a server-side guard, I’m not sure the SSL Client authentication mechanism is being used. And, webid semantics are restricted to client certs used in the client authentication procedure of the SSL … Continue reading →

In contrast to the MVC4 apparatus/templates, the openlink websso plugin for windows (live) weeo seems to directly use an OAUTH service – which is not simply a bridge to ws-fedp. However, using IE10, we cannot actually make ourselves a cert. … Continue reading →

Some notes: See http://www.isrn.com/journals/algebra/2012/956017/#B2

Having played with a generator of RM style “repetition codes” in Turing’s own machine, we get to see a more analytical treatment of RM itself – in which the 2 codewords are not just bit strings… but representation of linear … Continue reading →

Prof Forney does a good job teaching engineering, skilling students in engineering math while he is at it. At the end of the day, the engineer is a designer – working with parameters. What matters is to understand the role … Continue reading →

At 13:10, in http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-451-principles-of-digital-communication-ii-spring-2005/lecture-notes/lecture-15-trellis-representations-of-binary-linear-block-codes/ Prof. Forney sounds a little bored discussing the trellis version of a binary code generator. He cheers up after describing how (all my words and concept), now “bombe like” one can look at the “central” element … Continue reading →

The theory of computer science is rich – and even richer when you stick the computer science department in the middle of a long-established statistics department, focused on bayesian  methods (making a Department of Computer Science and Statistics). Why does … Continue reading →

In the era we are addressing, the art was to induce values in the packet header that would cause a change in code path .. in the packet handling routine. If one looks carefully, linux packets drivers for ipsec headers … Continue reading →

http://terrytao.wordpress.com/2007/07/27/dyadic-models/ If NSA and similar agencies wanted the veto on certain results of number theory research (historically), in what areas would the veto apply? It has to be those results that reduce complexity – having moved the problem from the … Continue reading →

  http://cryptome.org/2012/06/cia-stop-leaks.pdf

which is fine if you are in the lead, consuming 50% of the worlds resources. No wonder folks keep working on making the semantic web take off. http://en.wikipedia.org/wiki/Bose%E2%80%93Einstein_statistics what I like about the semantic web is that we get a … Continue reading →

The more we study 1930s research topics, the more we can read into Turing’s “on permutation groups” manuscript – and see the parallels. We see Turing taking a unit interval – obvious in one form to any 12 year old … Continue reading →

http://www.scribd.com/doc/58071880/Structural-Aspects-in-the-Theory-of-Probability-2ed-Heyer-eBook

  … http://www.fernuni-hagen.de/imperia/md/content/fakultaetfuermathematikundinformatik/forschung/berichte/bericht_286.pdf

http://www.nsa.gov/about/_files/cryptologic_heritage/publications/misc/tsec_kw26.pdf keytape and sync http://en.wikipedia.org/wiki/5-UCO http://www.jproc.ca/crypto/5uco.html

see https://yorkporc.wordpress.com/2011/04/29/nsa-signin-via-cryptome/ Now we understand that the turing bombe “unwrapped” the enigma rotor substitutions, the signin rotor cage looks more normal. The separator with its “mixed wire” substitution is like an unwrapped reflector. One sees 8 auto-powered rotors and that … Continue reading →

See image Lets see where this leads. Quite quickly, it leads us to equivalence sets – defined by difference constructs: See image From the idea of counting the run lengths of particular patterns (where each length/pattern is a residue class), … Continue reading →

Well thank god for the arrival of the adults. The opening credits of the intel said something about actual trust. Now the speaker starts weakly, overly delaying word delivery (paying too much attention to the speech coach). The Indian-English delivery … Continue reading →

  See at http://www.big-baboon.com/Education/Security/AES%20-DES.pdf Concerning the invertibility of the round, and the capacity for such as ECB to participate in key wrapping primitive in which a DES mode conformed of 2 runs work to protect keys (and thus the subkey … Continue reading →

Cryptome does us a favor (again), distributing 1955 Princeton thinking. (Where DOES he get this stuff from!) Remembering Princeton is the home of the American side of decidability debate and the Princeton CPU designs are well under way by 1955, … Continue reading →

After a sojourn from studying crypto, it was nice to get back to what now seems easier when reading a paper on des design. In a paper that is largely about 1930s metric theory for boolean functions, the author lays … Continue reading →

To the profile that Blogger manages about my account (home_pw@msn.com), we can adds facts to the hcard. Or, as we shall see, more precisely stated, we will add our own hcard instance. First, lets see what the outside world thinks … Continue reading →