I am doing an error propagation experiment with the CBC mode.I have encrypted a 100 byte text file with openssl. I made the 55th bytes of my encrypted file corrupted.As per theory the corresponding block of 49-64 bytes and the subsequent block of 65-80 bytes should be affected on decryption.But I am only getting the 49-63 bytes impacted in the result.Any help to let me understand this contradiction will be appreciated.
From :  Error propagation It was common to discuss the &quot;error propagation&quot; properties as a selection criterion for a mode of operation. It might be observed, for example, that a one-block error in the transmitted ciphertext would result in a one-block error in the reconstructed plaintext for ECB mode encryption, while in CBC mode such an error would affect two blocks.  I read  similar post before. And I can understand that in CBC decryption, only two blocks are affected due to error propagation (error in 1 block). But, for the same case in CBC encryption, why are still only two blocks affected? It looks like all the following blocks will be affected.
In , DVK says:     Snoke ... we still have no idea who he is but he predates Galactic Empire...   Having seen the film twice, I can't remember how we would know that, I don't recall references to Snoke's age or past history. But  is knowledgeable about Star Wars in general, is there something that tells us this? In the film, or the novelisation, or...? Quotient rings of Gaussian integers Let $(x_n)_{n=1}^{\infty}$ be a sequence such that $|x_{n+1} - x_n| &lt; r^n$ for all $n \geq 1$, for some $0 &lt; r &lt; 1$. Prove that $(x_n)_{n=1}^{\infty}$ is a Cauchy sequence.  I understand that a Cauchy sequence means that for all $\varepsilon &gt; 0$ $\exists N$ so that for $n,m \ge N$ we have $|a_m - a_n| \le \varepsilon$. But this one is really giving me a headache.  I tried doing something like: let $ m &gt; n$. Therefore $x_n - x_m$ =  $(x_n - x_{n-1}) + (x_{n-1} - x_{n-2}) + ... + (x_{m+1} - x_m) $ and then somehow using the triangle inequality to compute some sum such that $x_n - x_m$  &lt; sum which would be epsilon?  any help is appreciated, thank you. I cannot find these strings using Transifex:      (name hidden from user)       Regards,   {site name} Moderation Team          There is  and it seems like this string does not work ok (it is translated and approved, but, unfortunately, not rendered on the site).   All of the strings are taken from Moderator Private Messages interface.   Could you please fix it? Could any one give an example of a bijective map from $\mathbb{R}^3\rightarrow \mathbb{R}$?  Thank you. How does gravity escape a black hole? When I googled stomach flu, there were many questions and statements like      How do you get the stomach flu?    Or     Difference between a stomach flu and food poisoning    Or      Six facts about stomach flu   When do you use the, a or nothing? And which should I use for a sentence like "I got a stomach flu from someone" ? If I solve someones problem instead of answering their question, should I post a comment instead? Is Einstein's Special Relativity completely inclusive of Newton's 3 laws of motion? Relativity has always been explained to me (in books I've read, etc) as a superset of newton's laws - that is; it encapsulates all of Newton's mechanics in addition to other effects (observer effect, time dilation, space-time geometry, etc).   I can kind of imagine 2 of Newton's 3 laws of motion to be incapsulated within Einstein's Special Relativity, but the one about "for every action there is an equal and opposite reaction", I'm struggling to find a place for that within Special Relativity.   Does this sit outside Special Relativity's explanatory power or is it inferred within somehow? youtube-dl failed to extract signature Time Complexity of $T(n)=T(n-2)+\frac{1}{\log(n)}$ What license does Ubuntu fall into (GPL, MIT, a mix)? Would it be legal to modify it and redistribute my modified version? Einstein's big revelation was that time and space are inseparable components of the same fabric. Physical observation tells us that distant galaxies are moving away from us at an accelerated rate, and because of the difficulty (impossibility?) of defining a coordinate system where things have well defined coordinates while also moving away from each other without changing the metric on the space, we interpret this to mean that space itself is expanding.   Because space and time are so directly intertwined is it possible that time too is expanding? Or perhaps it could be contracting? Pick an urn and pick two balls from the urn There are 5 urns, the nth urn contains n − 1 red balls and 5 − n green balls (in total 4 ineach urn). We pick an urn at random and take 2 balls out of it without replacement.  (a) What is the probability the second ball is green?  (b) What is the probability the second ball is green given the ﬁrst is green?  (c) What is the probability we picked either the ﬁrst urn or second urn given both balls are green?  for (a), I did:   P(2nd ball is green) = 5*[{P(i th urn picked) * P(first ball drawn red/ ith urn picked) P(2nd ball drwan green/first ball red)}+ {P(i th urn picked) * P(first ball drawn green/ ith urn picked) P(2nd ball drwan green/first ball green)}]  = 5*[[{1/5 * (n-1)/4 * (5-n)/3 } + {1/5 * (5-n)/4 * (4-n)/3}] = 5* [{(n-1)(5-n)/60} + {(5-n)(4-n)/ 60}]  =[(n-1)(5-n) + (5-n)(4-n)]/12 = (5-n)(n-1+4-n)/12 = (5-n)*3/12 = (5-n)/4  And for b): 5*{P(i th urn picked) * P(first ball drawn green/ ith urn picked) P(2nd ball drwan green/first ball green)} = 5*{1/5 * (5-n)/4 * (4-n)/3} =(4-n)(5-n)/12  c), P(1st urn or 2nd urn/ both are green) = [ [P(1st or 2nd]* (4-n)(5-n)/6 ] / [{P(1st or 2nd]* (4-n)(5-n)/6} + {{P(3rd or 4th]* (4-n)(5-n)/6}] = {(4-n)(5-n)/15} /  2*{(4-n)(5-n)/15} = 1/2  But I am really uncertain about my solutions. If anyone has different solution or easier way to get the answer please let me know! Thanks a lot! How to get next/previous record in MySQL? What are the browser and resolution stats for SO users? Google Analytics (and some log parsers) will give you breakdowns on usage of different browsers, different versions of those browsers and screen resolutions.  I'm just curious to know what SO users user. Any chance we could get some stats on that? You may view this as commercial information, in which case I understand (as i'ts relevant to marketing/advertising).  I'm also curious to know the # of users who read and/or post from mobile devices and if so which ones.  UPDATE: Please refrain from personal anecdotes ("I use..."). I'm interested in actual usage, not personal stories. Thankyou. How do I show a function on 2-adic units is continuous (using the 2-adic metric)?   I'd be happy to learn the general rule or definition. But in particular I need to show that $f(x)=\dfrac{3x+1}{2^{v_2(3x+1)}}$ is continuous at all odd numbers.  Since the function is isometric in $\lvert\cdot\rvert_2$, i.e. since $\lvert f(x)\rvert_2=\lvert x\rvert_2$ every orbit of the function is duplicated, multiplied by any power of $2$.  This can therefore be formulated in various ways; as a function though the odd numbers, through the dyadic rationals, but the following seems good to work with.  If we let $n$ be a positive integer and $k$ be the power of $2$ we can define:  $f(2^k(2n+1))=(3(2n+1)+1)\cdot2^k\cdot\lvert3(2n+1)+1\rvert_2$  So $f(2^k(2n+1)=(3n+2)\times2^k\times\lvert3n+2\rvert_2$  Here is what I have so far:  I think to prove continuity in the 2-adic metric I need $\lvert x_n-x\rvert_2=0\implies\lvert f(x_n)-f(x)\rvert_2=0$  I think $k$ and $n$ are independent so I think I can examine them independently.  Taking $k$ to infinity brings both $x$ and $f(x)$ to zero so that seems to satisfies the continuity requirement.  Moving on to $n$; this seems to be an exercise in proving convergence within odd integers which are in a sense a subset of the 2-adic units.  I know all Cauchy sequences in these converge to 2-adic units but not much more than that.  However I do have a little insight into this particular function.  For example if we examine the inputs $x$ which map to any given output of $f(x)$, it can fairly easily be shown that these $x$'s take the form of a set $\left\{4^mp+\dfrac{4^m-1}{3}:m,n\in\mathbb{N}\right\}$ so, at least for any given output $f(x)$ the inputs always converge to $x=\frac{-1}{3}$ as the intervals between them become large powers of $2$.  In fact the orbit of the function $a(2^kx)=2^k(4x+1)$ on variation of $x$ and holding $k$ fixed is in a sense orthogonal to $f(x)$; which is a restatement of the above except not in closed form. Why MonadPlus and not Monad + Monoid? Boolean and Texts I have used Hexagon for years but find that it sometimes crashes when trying to do Boolean operations with texts.  I have been trying to make the two tables of the Ten Commandments and have been trying to use Blender.  I did it about two years ago in Blender and lost everything on my computer so I am trying again with the latest version of Blender and am having difficulty.  I start with a cube and then get it close to the dimensions I would think the Ten Commandments might look like. I then bevel the top using the bevel modifier. But in doing it this way I don't have any cross sub divisions on the face of the object. I have tried sub dividing first but then I find that I can't bevel the top arches as far as I would like. I still don't know how to add divisions after I bevel the top. Yes I am still a novice at this program.  In any case I did figure out how to make text and turn them into an object. When I make the texts I do all four of the commandments for one side and then the other six for the other side. So this makes allot of texts to cut out.  When doing the Boolean operation in Difference sometimes nothing happens. I am thinking I need to have some sub - divisions on the face of the sized cube after it is beveled but am not really sure if this is the problem.  This whole thing about normal's is still Greek to me. I have watched some videos on how to cut letters into a cube but for some reason it does not work this easy after I bevel the top of the cube. Or it could be that Blender does not like a bunch of texts all at once.  Could someone show me a video or give me some simple steps to make my project work? error tex capacity exceeded log files added I am having a hard time figuring out where the problem is with my code/workflow. I previously posted this question , but then the same problem came straight back. When I run it in tex, I get an error input limit exceeded. The exact log is pasted below:  This is pdfTeX, Version 3.14159265-2.6-1.40.17 (MiKTeX 2.9.6210 64-bit) (preloaded format=pdflatex 2017.1.26)  26 JAN 2017 20:45 entering extended mode **./master.tex (master.tex LaTeX2e &lt;2016/03/31&gt; patch level 3 Babel &lt;3.9r&gt; and hyphenation patterns for 75 language(s) loaded. ("C:\Program Files\MiKTeX 2.9\tex\latex\base\article.cls" Document Class: article 2014/09/29 v1.4h Standard LaTeX document class ("C:\Program Files\MiKTeX 2.9\tex\latex\base\size11.clo" File: size11.clo 2014/09/29 v1.4h Standard LaTeX file (size option) ) \c@part=\count79 \c@section=\count80 \c@subsection=\count81 \c@subsubsection=\count82 \c@paragraph=\count83 \c@subparagraph=\count84 \c@figure=\count85 \c@table=\count86 \abovecaptionskip=\skip41 \belowcaptionskip=\skip42 \bibindent=\dimen102 ) ("C:\Program Files\MiKTeX 2.9\tex\latex\apacite\apacite.sty" Package: apacite 2013/07/21 v6.03 APA citation \c@BibCnt=\count87 \bibleftmargin=\skip43 \bibindent=\skip44 \bibparsep=\skip45 \bibitemsep=\skip46 \biblabelsep=\skip47 ) No file master.aux. \openout1 = `master.aux'.  LaTeX Font Info:    Checking defaults for OML/cmm/m/it on input line 5. LaTeX Font Info:    ... okay on input line 5. LaTeX Font Info:    Checking defaults for T1/cmr/m/n on input line 5. LaTeX Font Info:    ... okay on input line 5. LaTeX Font Info:    Checking defaults for OT1/cmr/m/n on input line 5. LaTeX Font Info:    ... okay on input line 5. LaTeX Font Info:    Checking defaults for OMS/cmsy/m/n on input line 5. LaTeX Font Info:    ... okay on input line 5. LaTeX Font Info:    Checking defaults for OMX/cmex/m/n on input line 5. LaTeX Font Info:    ... okay on input line 5. LaTeX Font Info:    Checking defaults for U/cmr/m/n on input line 5. LaTeX Font Info:    ... okay on input line 5. \c@maskedRefs=\count88 ("C:\Program Files\MiKTeX 2.9\tex\latex\apacite\english.apc" File: english.apc 2013/07/21 v6.03 apacite language file LaTeX Info: Redefining \BPBI on input line 129. LaTeX Info: Redefining \BHBI on input line 130. ) ! TeX capacity exceeded, sorry [input stack size=5000]. \AtBeginDocument #1-&gt;#1  l.5 \begin{document}  If you really absolutely need more capacity, you can ask a wizard to enlarge me.   Here is how much of TeX's memory you used:  641 strings out of 493333  7639 string characters out of 3139188  74825 words of memory out of 3000000  4254 multiletter control sequences out of 15000+200000  3940 words of font info for 15 fonts, out of 3000000 for 9000  1141 hyphenation exceptions out of 8191  5000i,0n,4998p,136b,36s stack positions out of 5000i,500n,10000p,200000b,50000s !  ==&gt; Fatal error occurred, no output PDF file produced!   I previously posted this question and thought I solved it but am having the same problem again.   The latex code I am trying to execute is below:   \documentclass[11pt,twoside]{article} \usepackage{apacite} \nocite{*}  \begin{document}   % title page. Edit as needed for future publications.  \title{Research Proposal} \author{Teererai Marange \\ Department of Computer Science \\ University of Auckland\\ \texttt{t.marange@auckland.ac.nz}} \date{January 26, 2017} \maketitle % end title page.    % abstract goes here \newpage \begin{abstract} Abstract goes here  \end{abstract} \newpage   % table of contents  \tableofcontents \newpage   %begin introduction  \section {Introduction} Lorem Ipsum Doremifaso   %\cite{Nedakeyword} use to cite     %references our biliography. This must go whereever we use our bibtex references  \bibliography{references} \bibliographystyle{apacite}   \end{document}   and the bib file that I am using to build the bibliography is below:   @misc{wikipedia1,   title = "Scripting language",   author = "Wikipedia",   url = {http://en.wikipedia.org/wiki/Scripting_language},   year = 2014, }