Prime Time - Mathematicians have tried in vain to this day to discoversome oreder inthe sequence of prime numbers... Computer History Museum MR01001101 :: Hiding in hue This short essay is on a small idea of Steganography, which in truth is quite limited, but with the amount of online traffic and the speed the Internet grows, even simple ideas can go unnoticed and are hopefully a bit of fun to explore. It may be documented else where on the web, but I didn't look as I quite enjoyed experimenting with it myself and thought I should write it down before I forget all about it. Below is a standard BMP containing some hidden items, which can be seen if you split it into HSL (Hue, Saturation and Light) channels and look at the Hue channel. (In PSP the command can be found under COLORS / SPLIT CHANNEL / SPLIT TO HSL) MULTI.BMP incorporates some ideas or areas that allow some scope for hidden data in non-compressed picture formats. The Hue channel is shown a standard greyscale palette with black representing a hue of 0 and white being 255. Both are basically red and very similar to the eye, but with Hues of 254 and 0 respectively.
Energy Lens™ - Energy Management Software Methods for Studying Coincidences One of my favorite mathematics papers of all time is called “Methods for Studying Coincidences.” By Persi Diaconis and Frederick Mosteller, it aims to provide a rigorous mathematical framework for the study of coincidences. Using probabilistic analysis, the paper explores everything from why we see newly learned words almost immediately after first learning them, to why double lottery winners exist, to even the frequency of meeting people with the same birthday. For example, when it comes to newly learned words, we are often astonished that as soon as we learn a new word, we begin to see it quite frequently, or at least soon after we learn it. Their analyses hinge on something that we often forget: while something might seem astonishing and a remarkable coincidence, if enough people are involved, chances are very good that one of them will have something “coincidental” happen to them. With a large enough sample, any outrageous thing is likely to happen.
Personal Programmer Debugging is the cornerstone of being a programmer. The first meaning of the verb to debug is to remove errors, but the meaning that really matters is to see into the execution of a program by examining it. A programmer that cannot debug effectively is blind. Idealists that think design, or analysis, or complexity theory, or whatnot, are more fundamental are not working programmers. The working programmer does not live in an ideal world. Even if you are perfect, your are surrounded by and must interact with code written by major software companies, organizations like GNU, and your colleagues. Debugging is about the running of programs, not programs themselves. To get visibility into the execution of a program you must be able to execute the code and observe something about it. The common ways of looking into the ‘innards’ of an executing program can be categorized as: Some beginners fear debugging when it requires modifying code. How to Debug by Splitting the Problem Space
MR01001101 :: Stego for beginners (All views are my own opinion, so if you don't like them - don't read it) What is it and what's it for? Steganography is the art of hiding information in such a way that others would not suspect that it is there. It is closely linked to Cryptography, but offers some interesting features which Crypto, when used by itself cannot. Have a look at this example: Criminal A sends an encrpyted message to Criminal B. Now consider: Criminal A is an avid E-Bayer, he is selling his vacuum cleaner and puts it up for sale with a nice picture. Criminal A has actually embedded a secret message into the picture of his Vacuum cleaner, which Criminal B has retreived from his browser cache after closing all network connections. Who uses it? As in all walks of technology, the people with the most to lose tend to accept and embrace new technology. Does the fact that such groups make up a large proportion of users of steganography, make steganoraphy itself bad? Where can I hide things? Back Home
Mathematical Atlas: A gateway to Mathematics Welcome! This is a collection of short articles designed to provide an introduction to the areas of modern mathematics and pointers to further information, as well as answers to some common (or not!) questions. The material is arranged in a hierarchy of disciplines, each with its own index page ("blue pages"). To reach the best page for your interests, use whichever of these navigation tools ("purple pages") you prefer: For resources useful in all areas of mathematics try 00: General Mathematics. There is a backlog of articles awaiting editing before they are referenced in the blue pages, but you are welcome to snoop around VIRUS WARNING: The Mathematical Atlas receives but does not send mail using the math-atlas.org domain name. Please bookmark any pages at this site with the URL This URL forces frames; for a frame-free version use
Bucaro Hash Function JH; designed by Hongjun Wu JH is a hash function submitted to the NIST hash competition (2008--2012) in October 2008. It was selected as a finalist of the competition. There are four JH hash algorithms, namely, JH-224, JH-256, JH-384 and JH-512, constructed from the same compression function. In January 2011, the round number of JH is changed from 35.5 to 42 for better hardware efficiency and larger security margin. The hash speed of JH is about 19.6 cycles/byte on the mobile Intel Core 2 Duo T6600 2.2GHz processor running 64-bit operating system, and 23.3 cycles/byte for 32-bit operating system (bitslice C implementation with Intel C++ compiler). JH is efficient in hardware since simple components and identical round functions are used. In the design of JH, we proposed a new structure to design a compression function from a large permutation (bijective function). JH is not covered by any patent and JH is freely-available. Round 3 In December 2010, JH was selected for the third round. All the Submission Packages
Poker -- from Wolfram MathWorld Poker is a card game played with a normal deck of 52 cards. Sometimes, additional cards called "jokers" are also used. In straight or draw poker, each player is normally dealt a hand of five cards. Depending on the variant, players then discard and redraw cards, trying to improve their hands. Bets are placed at each discard step. The number of possible distinct five-card hands is equal to the number of possible ways of picking five cards out of a deck of 52, namely where is a binomial coefficient. There are special names for specific types of hands. The probabilities of being dealt five-card poker hands of a given type (before discarding and with no jokers) on the initial deal are given below (Packel 1981). denotes a binomial coefficient. are Gadbois (1996) gives probabilities for hands if two jokers are included, and points out that it is impossible to rank hands in any single way which is consistent with the relative frequency of the hands.