Sample APA Template Following 5th Edition Style



Mathemagical Encryption:

Variable Block Length Encryption

Canek Acosta

University of Florida

Abstract

Over the course of the past semester I have been learning card tricks. It did not take long for me to come across what are referred to as “self-working” tricks. Many of these are based on mathematics and led me to envision a variable block length encryption scheme. I have chosen to pursue this as my term project because I had noticed there are almost no textbook examples of variable block length encryption, as well as the fact that it was an exciting application for the concepts I had learned practicing magic and in this class.

Mathemagical Encryption:

Variable Block Length Encryption

Throughout the course, we have discussed block and stream ciphers. Block ciphers took a fixed amount of bits, bytes, or characters and rearranged them either by transposition, substitution, or a combination of the two. Stream ciphers,which worked with data as it came in, still eventually broke them into fixed quantities to in order to encrypt and decrypt the data. Today variable block size, means to most, the compatibility of an algorithm with various block sizes. I , however, propose a system of encryption with what I'll call true variability. What I mean by this is that each and every block you work with can be a completely different block size without causing any issues whatsoever in the encryption scheme. First, we will introduce the mathematics behind the encryption scheme.

Mathematical Background

Down Under Deal

The Down Under Deal, otherwise known as the Australian Shuffle, is a component of various magic tricks. If dealt in a particular manner, each pile of cards can effectively be reduced to one predictable card. The Down Under Deal is done exactly how it sounds. You take the top card of a pile and discard it or place it down on the table. Then you take the next card and place it under the pile. This is repeated until one card remains. The card remaining is mathematically predictable. It will be 2(z mod 2^x) where x = max(x| 2^x ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download