# Category Archives: crypto

## tunny cryptanalysis before the machine age

We learn that depths provided sufficient evidence to figure the chi and psi wheel patterns – which were changing quarterly or monthly, only. And , we know that before the machine age of GCCS really got going that this change … Continue reading

## Ps and Qs (and an unexceptional understanding of KEA)

http://blog.cryptographyengineering.com/2015/01/hopefully-last-post-ill-ever-write-on.html is interesting for its discussion of Ps and Qs. Long ago, I got a briefing (from NSA folk) on the security architecture and crypto algorithms used in the security mechanisms for the type II version of MSP – the … Continue reading

## HSM, EAL4 and worthless assurances from Microsoft Azure on crypto

http://azure.microsoft.com/blog/2015/01/08/azure-is-now-bigger-faster-more-open-and-more-secure/ Trust is hard to obtain and maintain – especially in a world now well-tuned into the cynicism that expects large corporations to be working with governments in the execution of systemic, trust-based deception plan. If you must, call it … Continue reading

## 1940s crypto secrets

Things that were considered worthy of being classified (as 1930s-era secrets in the field of cryptanalysis) included what we would now call iterative methods (in algorithm design). One example of an iterative method the highly-crypt0-centric method of banburismus – the … Continue reading

## diffusing concentrations of probability; oracles based on superposition encodings

We can compare the argument for introducing an ‘oracle’ – that hides the names of the edge/color labels used by one binary tree from the other… with the intuition given for how the zig-zag product creates rotation algebras … Continue reading

## math and cryptanalysis–some notes

three observations about math and crypto. 1. Quaternion “Algebras” Its fun to look at quaternions as a special kind of polynomial sum, with terms weighted as is usual. Then, its interesting to see how to abstract H, the quaternions, … Continue reading

## developing cryptographic intuitions for quantum era

we learned from the description of the us 1945 5205 cryptographic process how, despite all its engineering complexity, the machine counted how many time certain (high scoring, distinguishing) characters appeared in a tunny stream. for example, compute chi (5bits) xor … Continue reading

## k-order propagation in hyperbolic reasoning calculation spaces

if we think in terms of Wildberger’s universal hyberbolic geometry, the case for defenses against linear cryptanalysis is one of ensuring that a wheel of points is assumed to have to each point a binary value and one looks … Continue reading

## hamming weights, correlation immunity, proportional bulge algebras

Correlation of Boolean Functions – MIT – Massachusetts Institute the original conception of golomb is far more intuitive than others, particularly when taking into consideration https://www.youtube.com/watch?v=PSFr6_EhchI#t=1222 this guy does a great job of reasoning much … Continue reading

## more DES (crypto rubbish by Peter)

Now for one of my math-like missives (that is the kind of submission from a crank that every math professor gets in the post once in a while from an amateur math nut). Its on topics I don’t understand. As … Continue reading

## latest thoughts on what Turing teaches about ciphering and cryptanalysis

Folks following this blog (all 3 of you) might know that I’ve spent now 4 years learning to do cryptanalysis. 3 of them was finding out what it even was/is. One test of what I am even now still learning … Continue reading

## cryptanalytical mechanisms not based on silicon; Turing light cones

http://en.wikipedia.org/wiki/Super_Kamiokande The case for a detector (for very tiny discriminants, from differential trails) NOT being based in silicon chips but being based in nuclear knowhow is STRONG. The case for a cryptanalytical search engine, working at an accuracy … Continue reading

## Linking Expander graphs to DES avalanche ideas

Having been away from 1950s cryptanalysis for a few weeks has helped – in the sense that we come to the material now somewhat refreshed; able to see connections that we missed. In particular, we look at expander graphs – … Continue reading

## simple model of linear vs differential cryptanalysis

My discussion of this topic in public, circa 1990, was what piqued NSA’s interest in me (and our university security – vs crypto – project). I suspect it was heightened by several facts, not all of which its fair to … Continue reading

## Turing, actions from rep of permutation swap, Chi/Characteristic, expander graph family

https://yorkporc.wordpress.com/2014/04/05/quantum-random-walks-along-turing-era-world-lines-with-swaps-built-into-1950s-rotor-machine/ We can see now that Turing was modeling this, using a rotor wiring plan etc. The alternating group is a manifestation of the constant group. So we can see that GCHQ has had qudit computational models for 50+ … Continue reading

## giving nsa/gchq a helping hand (re microsoft online immutableid guessing/calculation)

1 param([string[]]$args) 2 3 4 $msolcred = Get-Credential -UserName admin@netmagic.onmicrosoft.com ` 5 -Message "password for netmagic is Fred!" 6 Connect-MsolService -Credential $msolcred -ErrorAction Stop 7 8 $setfed = Get-MsolDomainFederationSettings -DomainName "rapmlsqa.com" 9 $alog = $setfed.ActiveLogOnUri 10 11 $strarr = $alog.Split(‘/’) … Continue reading

## https://johncarlosbaez.wordpress.com/2012/07/30/increasing-the-signal-to-noise-ratio-with-more-noise/

The 1940s sigsaly secure voice communication model of PAM is nicely summarized by Forney at the chapter from his MIT courseware: Its worth a read since it leverages the math that I, for one, have got down from studying quantum … Continue reading

## thermodynamic reversibility and unitary crypto gates

I like the last paragraph. It puts into stark perspective, of thermodynamics, the difference between the random walk and the quantum walk. The notion of the random walk “damping” all but the first eigenstate is clear, when seeing how the … Continue reading

## generating minimum distance and t-resiliency, for channel reliability

it turns out useful to go re-review some of our year 3 curriculum on coding, channels, sampling, decibels etc now we that have the perspective afforded to use in studying year 4 topics. Our math is strong enough now to … Continue reading

## quantum random walks along Turing-era world lines, with swaps, built into 1950s rotor machine

Roland does a really great job of putting into a couple of pictures the move from random to quantum walks when working in the Tunny-era “sign” (bit!) basis (of –1 and 1) https://yorkporc.wordpress.com/2013/03/24/quantum-walksfor-quotient-groups/ Not only that, he captures in a … Continue reading

## contrasting X method of cryptanalysis with differential cryptanalysis

In Turing’s On Permutations manuscript, circa 1954, he makes an argument about sequences of continuous functions (in continuous spaces). This enables him to reach a conclusion about uniform “limiting” distributions. We have a reasonable understanding of this theory, now – … Continue reading

## notes to self

Lets also recall the lesson of the Russian cipher comparing how the matrix transform computes an inner product whose value drives the non-linear function – in the sense that certain state bits in DES use 2 bits of an expanded … Continue reading

## rotor machine for block ciphering

http://www.quadibloc.com/crypto/ro020404.htm Lets assume that the device is for making keytapes for cryptonets, given as master key tape for the day. Given yesterdays per-cryptonet encriphering tape, make todays per-cryptonet enciphering (and deciphering) tapes by shifting the new daily seed tape. Lets … Continue reading

## From crypto wheel wiring to bilinear transforms and log-likelihood basis

When I studied conditional probability, methods and notation , from the department of statistics (of which our computer science “unit” was originally a part), I struggled. No, let’s be truthful: I hated it. Studying the same ideas, notation and methods … Continue reading

## linking permutation group swapping with global phase changes, and quantum mechanics multi-particle analysis

see minute 19 Susskind makes some more connections for us – THIS time between the two halves of the Turing manuscript on permutations, lie algebras, and norm contraction by normalizer subgroups generating operator-norms, operator-kets, and super-operators. Specifically, WE can now … Continue reading

## connecting 1945-era “nsa” cryptanalysis to quantum mechanics and modern laser-based cryptanalysis.

Back to Turing’s crypto model, expressed by physics lecture 11, bala When discussing the coherent states of light (in a lecture that comes on the heels of her discussion of the compressed quantum-only state) her argument starts out, Turing … Continue reading

## turing spin

http://www.turingarchive.org/viewer/?id=133&title=05a just realized that this is turings model of 1) electron spin with its intrinsic angular momentum, and 2) the angular mometnum due to its orbit, in 3) a symmetric set of energy states.

## padic distance, rotating geometries, walsh functions

In https://yorkporc.wordpress.com/2014/01/28/comparing-des-sbox-design-theory-with-colossue-era-language-about-proportional-bulges/ we got to see the relevance of a padic distance and its relationship to the walsh “measures” used in analyzing sboxes. Its also fun to put together “rotation” theory with padics. We know from our thinking about the … Continue reading