I received an email recently that reads:     Your org has been identified as having users or integrations still   connecting to Salesforce using TLS 1.0 encryption protocol during the   month of February.   That led me to ask an initial question around how I can figure out who is using TLS 1.0:   Unlike that question, this one is about the email I received from Salesforce, that seems to contradict what I am seeing in the login history. It's not about how I can pull the login history in the first place.  I pulled the login history from Sep 2016 through Apr 2017, and all of my users (and API calls) have been using TLS 1.2. So the email appears to contradict what the logs say. I downloaded all logs available and I filtered on the protocol column in Excel and it only has TLS 1.2. There are zero instances of TLS 1.1 or 1.0 in the log file. The log file includes activity.  Is it safe to assume that I'm only using TLS 1.2 since that is what the logs say? I'm just concerned about the Salesforce email stating otherwise.
We are using .Net to make web service calls the Salesforce API. Is there a way to know for sure that the calls are using TLS 1.2? Are there any API logs or records of the protocol is use in Salesforce we can review to be confident the change is working?
In a  a doubt was voiced about my answer, which claims GCM to requires $2^{128}$ for a successful forgery. The doubt was that the square root needs to be taken meaning the security would be $2^{64}$.  So of course I immediately checked the relevant security theorem ():  $$\mathbf{Adv}^{\text{auth}}_{\operatorname{GCM}[\operatorname{Perm}(n),\tau]}(\mathcal A)\leq \frac{0.5(\sigma+q+q'+1)^2}{2^n}+\frac{q'(\ell_A+1)}{2^\tau}$$  with $\sigma$ being the total plaintext size in blocks, $q$ being the total number of encryption queries, $q'$ being the total number of decryption queries, $n$ being the size in bits of the underlying permutation, $\ell_A$ being maximum authenticated input length in blocks and $\tau$ being the tag size in bits.  Now clearly from this we can see that performing $2^{n/2}=2^{64}$ queries yields a strong enough advantage for a break.  Now my question is: When talking about "n-bits of security" or "needs $2^n$ operations to break", do we usually talk about "online" security, ie queries to an oracle can be done and cost $1$ or "offline" security where no oracles are available or do we need to make this decision depending on the situation?  TL;DR: Does GCM offer 64 or 128 bit security? Following my question , I am wondering if there are strong views for or against the use of standard deviation to detect outliers (e.g. any datapoint that is more than 2 standard deviation is an outlier).  I know this is dependent on the context of the study, for instance a data point, 48kg, will certainly be an outlier in a study of babies' weight but not in a study of adults' weight.  Outliers are the result of a number of factors such as data entry mistakes. In my case, these processes are robust.   I guess the question I am asking is: Is using standard deviation a sound method for detecting outliers? When to use \par and when \\, \newline, or blank lines What is the difference between \par, \newline, \\ and blank lines? When should I use which one? Windows 10 thinks it's up to date, but it's not Keeping track of where everyone is is hard.  I could be out in the wasteland while Dogmeat will let me know he found something. That's great, but then it's a chore trying to find him a lot of times. Sometimes, he'll even run ahead and attack enemies and I'll lose sight of him. Only if I leave an area sufficiently far enough, he'll come back and meet with me which isn't always possible. I know I can listen out for him but visual indicators would be better. But none of this works if I sent him to a settlement but needed to find him and he hasn't returned yet.  Is there anything we can do to make locating companions in the world easier? Convert and redirect URL in uppercase to lowercase using .htaccess I would like to redirect a URL with uppercase characters http://localhost/A/B to a lowercase version http://localhost/a/b using the .htaccess file. Using regex I can capture A and B but is it possible to convert them to lowercase? Need fast solution how to show series expansion of function at x=0:  $$f(x)=\frac{3x}{1+x^2+x^4}$$  Please some hints. String.split() *not* on regular expression? Finding $\frac {d(\tan \theta)}{d\theta}$ What is the quantum mechanical explanation of the octet rule? What is the quantum mechanical explanation of the ? In other words, what makes the octet rule be true from a quantum mechanical view? How we explain  what makes some atoms don't follow the octet rule using QM? Finding the Eclipse Version Number Need a comma before an adverb as last word in sentence? How can I save my hardcore map after I die? My brother jumped into the voice of the doom in my Hardcore Creative map. I didn't press the ΄΄Delete This World΄΄ button yet. Process substitution and pipe Suggested improvements to badges index page ()  Currently,  shows the possible badges, number of total recipients, and brief descriptions. However, I have a few suggestions (mostly minor changes) that could make it a bit nicer.   There is no way to see (on that page) which badges I've earned multiple times — they all appear with a green checkmark. It would be nice to show something like "x 4" like in the badges section of the user profile page. For example:      There is no way to see which badges can be awarded multiple times — you have to click on a specific badge to see yea or nay. It would be nice to have a small, simple icon next to badges that can be earned multiple times, similar to the checkmark showing which badges I've earned. The layout would be nicer if the number of recipients for each badge were in a separate column — since the badge images are different sizes, the overlap and ragged right alignment makes the numbers harder to read. An alternative view that groups badges by "achievement level" (gold/silver/bronze) would be nice, as would a view that groups progressive degrees of the same accomplishment. (e.g. Nice Answer &rarr; Good Answer &rarr; Great Answer OR Popular Question &rarr; Notable Question &rarr; Famous Question) $.ajax call working fine in IE8 and Doesn't work in firefox and chrome browsers When are "if" and "whether" equivalent? Are if and whether equivalent in sentences like the ones below?     How to determine if my saddle is too high?   How to determine whether my saddle is too high?         We should check if everything is okay now.   We should check whether everything is okay now. Capitalization of explanation of abbreviations How to show that $\sum\limits_{k=0}^n (-1)^k\tfrac{{ {n}\choose{k}}}{{ {x+k}\choose{k}}} = \frac{x}{x+n}$ I'm trying to show that      $$\sum_{k=0}^n (-1)^k\frac{{ {n}\choose{k}}}{{ {x+k}\choose{k}}} = \frac{x}{x+n}$$   I've tried expanding this using definition of binomial coefficient, then binomial expansion, now I'm using induction to simplify $\sum_{k=0}^m (-1)^k\frac{{ {n}\choose{k}}}{{ {x+k}\choose{k}}}$, but it looks very inelegant, is there a better way? Failed to Login : Invalid session (Try restarting your game) Minecraft Error