RSA PADDING WITH e=3
Which attacks are possible against raw/textbook RSA?
Converting a year from 4 digit to 2 digit and back again in C# My credit card processor requires I send a two-digit year from the credit card expiration date. Here is how I am currently processing:   I put a DropDownList of the 4-digit year on the page. I validate the expiration date in a DateTime field to be sure that the expiration date being passed to the CC processor isn't expired. I send a two-digit year to the CC processor (as required). I do this via a substring of the value from the year DDL.   Is there a method out there to convert a four-digit year to a two-digit year. I am not seeing anything on the DateTime object. Or should I just keep processing it as I am? Linux Debian codenames I've got a few, quite silly, non-technical questions about giving  to  releases.  Each Debian release has its unique codename, which is (so far) a characters' name from  movies by .  Here is list of all assigned codenames so far:   release 1.1 is  (Buzz Lightyear) - the spaceman, release 1.2 is  - the tyrannosaurus, release 1.3.x is  (Bo Peep) - the girl who took care of the sheep, release 2.0 is  - the piggy bank, release 2.1 is  (Slinky Dog) - the toy dog, release 2.2 is  - Mr. Potato, release 3.0 is  -  the cowboy, release 3.1 is  - the sergeant of the Green Plastic Army Men, release 4.0 is  - the toy blackboard (Etch-a-Sketch), release 5.0 is  - the toy binoculars, release 6.0 is  - the name for the three-eyed aliens, release 7.0 is  - the name of the rubber toy penguin with a red bow tie, release 8.0 is  - the name of the yodelling cowgirl, release 9.0 is  - a purple rubbery octopus toy at , release 10.0 is  - 's pet dachshund (currently ).   List of upcoming major Debian releases' codenames after :   release 11.0 is  - 's horse (currently ), release 12.0 is  - intelligent worm toy with a built-in flashlight.   There are also:   special codename  () which is symbolic link to codename which is currently unstable,  which is symbolic link to codename which is currently stable,  which is symbolic link to codename which is currently testing.   The list of Toy Story  is quite  but at some time, there will be no more characters' names to assign.  My questions are:   What codenames will be assigned if we run out of characters' names? Who decides what is codename of next release (please don't answer ambiguously like: 'community')? How many releases' names are planned ahead?   BTW: Interesting quote from :     The  of using Toy Story names was  by  who   was, at the time, the Debian Project Leader and was working also at   , the company that produced the movies.     by  (: ). Specify a bijection from [0,1] to (0,1]. How to show $a,b$ coprime to $n\Rightarrow ab$ coprime to $n$? Proof that the real numbers are countable: Help with why this is wrong I'm reading page number 4 here. In particular the section where it deals with the case $p=\infty$, that is , showing that $L^{\infty}$ is complete.    Two questions:  1) Why is the convergence uniform? where it says "for $x \in N^{c}$ , $f_{n}$ is a Cauchy sequence of complex numbers. Thus $f_{n} \rightarrow f$ uniformly. Clearly we have pointwise convergence but why is it uniform?  2) I don't see why $||f_{n} - f||_{\infty} \rightarrow 0$. Can you please explain this step?  Thanks.  (3/2015) Edit: The original link appears to be broken.  seems to provide a similar (maybe even identical) proof to the one the OP talks about with slight notational differences. probability that exactly two accidents happen in any day of a week if 7 accidents happen in a week If 7 accidents happen in a week, what is the probability that exactly 2 accidents happen in any day of the week.  I tried to work it this way.  2 accidents out of 7 can be taken in ${7}\choose{2}$$= 21$.  Now this can happen in any of the 7 days, so we have $7 \times 21$.  Now, the remaining 5 can happen in $6^5$ ways.  So the probability is  $\frac{7\times 21 \times 6^5}{7^7} = \frac{3 \times 6^5}{7^5}$   But this gives me a value greater than 1.   I know I am doing something wrong.  Can anyone help me ? Define a linear operator $T:C[0,1] \to C[0,1]$ as follows: $$Tf(x) = f(x) + \int_0^x f(u)du$$ It is easy to show that $T$ is a bounded linear operator. The statement also (1) claims that $T$ is one-to-one and onto, and (2) asks to compute $T^{-1}$. (Hence $T$ is an isomorphism due to a corollary of Open Mapping Theorem)  I need help to prove $T$ is onto: given any $g \in C[0,1]$, how to decompose it into a sum between a continuous $f$ and its antiderivative. I have trouble decomposing $g(x)=|x|$, not to mention bizarre functions like Weierstrass function. It seems impossible.  Thanks in advance for help! Consider the following minimal example:  \documentclass{article}  \setlength{\parindent}{0mm}  \usepackage{paralist} \usepackage{tabto}  \begin{document}  \NumTabs{3} \begin{inparaenum} \item text \tab\item text \tab\item text \tab\item text \tab\item text \tab\item text    \end{inparaenum}  \end{document}   Which results in:    It does exactly what I want, but I was wondering whether it was possible to create an environment, say tabbedEnum so that we can eliminate the use of the \tab, in particular, that the first case doesn't need a tab but all others do. Something of the form:   \begin{tabbedEnum}[3] \item text \item text \item text \item text \item text \item text \end{tabbedEnum} Are the floor functions of $0.999\cdots$ and 1 equal?  It is true that $0.999\cdots=1$ but how does one justifies the integer part of $0.999\cdots$ being 1 , where it is not, or alternatively without using $0.999\cdots=1$ how can we show that  $\lfloor0.999\cdots\rfloor = \lfloor 1 \rfloor$ ? Trouble doing polynomial interpolation I'm not sure how password hashing works (will be implementing it later), but need to create database schema now.  I'm thinking of limiting passwords to 4-20 characters, but as I understand after encrypting hash string will be of different length.  So, how to store these passwords in the database? I'm starting out in Visual C++ and I'd like to know how to keep the console window.  For instance this would be a typical "hello world" application:   int _tmain(int argc, _TCHAR* argv[]) {     cout &lt;&lt; "Hello World";     return 0; }   What's the line I'm missing? What is the difference between encrypting some data vs signing some data (using RSA)?    Does it simply reverse the role of the public-private keys?    For example, I want to use my private key to generate messages so only I can possibly be the sender.  I want my public key to be used to read the messages and I do not care who reads them.  I want to be able to encrypt certain information and use it as a product-key for my software.  I only care that I am the only one who can generate these.  I would like to include my public key in my software to decrypt/read the signature of the key.  I do not care who can read the data in the key, I only care that I am the only verifiable one who can generate them.  Is signing useful in this scenario? Is it possible to download using the Windows command line? Without using any non-standard (Windows included) utilities, is it possible to download using the Windows command line?  The preferred version is Windows XP, but it's also interesting to know for newer versions.  To further clarify my question:   It has to be using HTTP The file needs to be saved Standard clean Windows install, no extra tools   So basically, since everybody is screaming , I want simple Wget functionality, without using Wget. In Ubuntu 18.04.1, I would like to use my left Super-key only to simply open the Show Applications menu (aka Dash) like a left click on the dock-icon (with the 9 dots) does and preferably close it again without showing me any open programs.   I can open it with Super + A and even close it again with Super R, but Super L appears to do nothing at all.   In Xfce, something similar was possible by adding a custom keyboard shortcut for Super L and setting the command to xfce4-popup-whiskermenu, which would open and close a menu with favourite applications. Unfortunately, I don't know the command that opens and closes the Show Applications menu.   Is there any way to add such a shortcut in the new Gnome Shell? What is the radius of convergence of $\sum z^{n!}$? How to find the radius of convergence of $\sum z^{n!}$?   I'm used to applying the ratio test to power series of the form $\sum a_{n}z^{n}$, but for a different power of $z$, I am a bit stumped. What about $\sum z^{2n+a}$ for another example? Where $a\in \mathbb{R}$. Define $\sigma(m) = \sum$ d : d|n.  Prove that $p^j$$q^i$ cannot be a perfect number for $p, q$ odd, distinct primes.  Attempt at Solution: I have shown that $p^k$ can never be a perfect number, and im trying to use the multiplicative property of $\sigma$ to generalize to $p^j$$q^i$ Prevent Adobe Reader from switching to "Fit Page" zoom when bookmark is clicked I covered hyperbolic trigonometric functions in a recent maths course. However I was never presented with any reasons as to why (or even if) they are useful.  Is there any good examples of their uses outside academia?