DOCSLIB.ORG

4 Cryptography

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
4 Cryptography V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography 4 Cryptography LOBBY VULTM XYQBB UWZGY QVTTB RYVZU VQZEB XZDNV KKQHI BKBHO UBWBU ZDLQY ZWBRZ WBYQV TPBTT HLBNV YQZDY YZZPD RQYOZ DMKBV YVTRZ WBWDT VULHU HGGVU BRZWB TZVYV THTVP EKBTD MTYVY DYVZU RZWBT VURBV YVTEO BTBUY BWVUM KZRFT ZGGVI BVYTQ HOWBO YZWBR ZWBYQ BGVOT YEBOT ZUVUY QBRKH TTNQZ WBRZW BTVYH UWUZY VGVBT PBMXB PHVKL BYTHT EBRVH KEOVC B A message such as this is meant to appear as a meaningless jumble to most anyone who reads it. It is a simple message coded in a simple way. In this section, we shall learn different ways to code messages, and some approaches used to decode them. Cryptography is a discipline which concerns itself with communication secrecy. Coded mes- sages have long been used by businesses, governments and the military, and for obvious reasons. If you want to send a message to a friend or partner, you do not want it to under- stood by everyone who intercepts that message. Even before the advent of the computer, and the possibility of sending (and intercepting) electronic messages, it was well understood that some coding device was necessary to insure secrecy from “the enemy” who might intercept messages. With the advent of the computer, issues of secrecy have come closer to home, because elec- tronic interception (snooping) has become commonplace, and much easier. When ordering on the Internet, and you give your credit card number, you do not want any intruder to find it. So responsible companies who do business on the Internet must use very sophisticated coding systems to keep this information secret from intruders. In this section we consider some of the methods used to code and decode messages. For simplicity in our treatment, we shall start by sending with messages using the 26 letters A through Z. Thus, we omit small letters, punctuation, spaces, and even numerals. It is convenient to assign numbers to these letters, and the most natural numbering is given in the following table. Letter A B C D E F G H I J K L M Number 1 2 3 4 5 6 7 8 9 10 11 12 13 Letter N O P Q R S T U V W X Y Z Number 14 15 16 17 18 19 20 21 22 23 24 25 0 35 Note that we have assigned Z the number 0, rather than 26. This is because we shall work modulo 26–with remainders when we divide by 26–so it is most convenient to use the numbers from 0 through 25. (Computer scientists usually start labeling A as 0, etc. but we have avoided this, since most of us have learned that A is the first letter, B the second, etc.) It will be useful to learn this table. I find the simplest way is to know that the numbers 5, 10, 15, 20, and 25 correspond to E, J, O, T, and Y. If you know your alphabet, the rest is easy. Shift Substitutions. A very simple coding device is to replace every letter by the letter two positions after it. Thus, A is replaced by C, B by D, and so on. When we come to Y, we replace it by A (going around the circle). Similarly, replace Z by B. Thus, the message STAY RIGHT THERE FOR NOW will be coded as UVCA TKIJV VJGTG HQT PQY or UVCAT KIJVV JGTGH QTPQY since it is customary in coding to give the message in groups of 5 letters. (The spaces between words may give clues as the possible meanings.) Such a code was used by Julius Caesar, and so it has a long history. The person who receives the message UVCAT KIJVV JGTGH QTPQY and who knows the coding device will replace each letter by the letter two before it. The result is of course: STAYR IGHTT HEREF ORNOW The words can now easily be separated and the message is decoded. The original message is called the plaintext; the coded version is called the ciphertext.The process of changing plaintext into ciphertext is called coding or encryption. The process of changing ciphertext back into plaintext is called decoding or decryption. Encryption and decryption can be done if you are privy to the method used. If you have intercepted a message in ciphertext, and you want to find its plaintext meaning, but you don’t know the decryption method, you must use the art of cryptanalysis to find the plaintext. This will be considered in what follows. The encryption above can be given by a simple mathematical formula. Coding A as C, B as D, etc. is described numerically as coding 1 as 3, 2 as 4, 3 as 5, etc. Just add 2. If the plaintext number is p and the corresponding ciphertext number is c,thenthiscodeis simply c = p + 2. However, this formula falls apart for X (24), Y (25) since 24 + 2 = 26, and 25 + 2 = 27. But the formulas will be valid if we work with the remainders when divided by 36 26–that is, congruence mod 26. Thus the correct encryption formula is c p +2mod26 (3) ≡ The congruence (3) can be solved for p: p c 2mod26 (4) ≡ − One of the necessary components of an encryption method is that a ciphertext should be easily coded and decoded by anyone who knows the method, and very difficult by someone doesn’t. Formulas (3) and (4) are simple schemes from this point of view. From our point of view, equation (4) is the decryption equation, since it converts ciphertext into plaintext, while equation (3) is the encryption equation. The conditions 0 p 25 and 0 c 25 ≤ ≤ ≤ ≤ are needed in order that p and c can be assigned a letter of the alphabet. We can illustrate these equations as follows: If the ciphertext letter is F, then we have c =6, since F is the 6th letter of the alphabet. Using equation (4), we find p c 2 mod 26, or p 4 mod 26. So the plaintext must be D, the fourth letter of the alphabet.≡ − On the other hand,≡ if the ciphertext was A, we would find p c 2 mod 26, or p 1 2= 1 mod 26. To convert 1 mod 26, we just add 26 (which is,≡ after− all, 0 mod 26)≡ to− find 1− 25 mod 26, and so the− plaintext letter is Y. Of course we can do this more easily without− a≡ formula: it amount to shifting two places to the left, and “going around a circle.” But in our later examples, this will be difficult to do without a formula. An encryption based on a formula of the type c p + a mod 26 (5) ≡ is called a shift code because we can think of shifting the alphabet over a spaces to do the coding. Because of this equation, it is also called an additive code or cipher. What makes it relatively easy to decipher is that we only have to know how one letter is enciphered to figure out the rest. Equivalently, we need to know the value of a.Hereisanexample. Example. Sally has intercepted the message YMJDF WJMJW J and believes that it is a ciphertext based on a shift code. Furthermore, she believes that the letter E is enciphered as J, because there are so many J’s in the ciphertext. Help her to decipher the message. Method. The conversion formula is of the form c p + a mod 26. We know that when p = 5 (plaintext E), we have c = 10 (ciphertext J).≡ Thus, 10 5+a mod 26. So a 5 ≡ ≡ 37 mod 26, and the encryption formula is c p + 5 mod 26. The ciphertext is thus obtained by shifting 5 to the right, and so deciphering≡ shifts 5 to the left: p c 5 mod 26. Now ≡ − work letter by letter. Y’s number is 25. Here c =25sop 25 5 = 20, so the plaintext corresponding to Y is T. The letter D, has c =4,sohere≡p −4 5= 1 25 (adding 26 to 1). Thus the plaintext for D is Y. Proceeding this way,≡ we− decode− this≡ messages as THEYA− REHER E, or adjusting spaces: THEY ARE HERE. For additive ciphers given by Equation (5), the entire code is known, once we know the single number a. This number is called the key for this coding. Obviously, when you know the key, coding and decoding is simple. Another usage, will come in handy, is to let the key be the ciphertext corresponding to the plaintext A. So for a shift of a =2,wecanspeakofthekey 2, or equivalently, the key C. Similarly, a shift code with key letter G will have a =6. While shift codes can be easily use for coding, they have a severe limitation. Since they are all of the form c p + a mod 26, there are only 25 encipherings of this type available corresponding to a =≡ 1 to 25. (Of course, a = 0 amounts to no coding at all, or the trivial coding.) If you know that a shift code is being used, all you would have to do is to try the 25 different values of a and the decoding of a message can be done. This can be done fairly easily by hand. And with the right computer program, all 25 possible decodings of a message can be done almost instantaneously. All shift codes are given on page 51. It is convenient to use this table for shift codes. The first line, the usual alphabet, is the plaintext line.
Load more

Recommended publications
  • Basic Cryptography
    Basic cryptography • How cryptography works... • Symmetric cryptography... • Public key cryptography... • Online Resources... • Printed Resources... I VP R 1 © Copyright 2002-2007 Haim Levkowitz How cryptography works • Plaintext • Ciphertext • Cryptographic algorithm • Key Decryption Key Algorithm Plaintext Ciphertext Encryption I VP R 2 © Copyright 2002-2007 Haim Levkowitz Simple cryptosystem ... ! ABCDEFGHIJKLMNOPQRSTUVWXYZ ! DEFGHIJKLMNOPQRSTUVWXYZABC • Caesar Cipher • Simple substitution cipher • ROT-13 • rotate by half the alphabet • A => N B => O I VP R 3 © Copyright 2002-2007 Haim Levkowitz Keys cryptosystems … • keys and keyspace ... • secret-key and public-key ... • key management ... • strength of key systems ... I VP R 4 © Copyright 2002-2007 Haim Levkowitz Keys and keyspace … • ROT: key is N • Brute force: 25 values of N • IDEA (international data encryption algorithm) in PGP: 2128 numeric keys • 1 billion keys / sec ==> >10,781,000,000,000,000,000,000 years I VP R 5 © Copyright 2002-2007 Haim Levkowitz Symmetric cryptography • DES • Triple DES, DESX, GDES, RDES • RC2, RC4, RC5 • IDEA Key • Blowfish Plaintext Encryption Ciphertext Decryption Plaintext Sender Recipient I VP R 6 © Copyright 2002-2007 Haim Levkowitz DES • Data Encryption Standard • US NIST (‘70s) • 56-bit key • Good then • Not enough now (cracked June 1997) • Discrete blocks of 64 bits • Often w/ CBC (cipherblock chaining) • Each blocks encr. depends on contents of previous => detect missing block I VP R 7 © Copyright 2002-2007 Haim Levkowitz Triple DES, DESX,
    [Show full text]
  • A Quantitative Study of Advanced Encryption Standard Performance
    United States Military Academy USMA Digital Commons West Point ETD 12-2018 A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility Daniel Hawthorne United States Military Academy, [email protected] Follow this and additional works at: https://digitalcommons.usmalibrary.org/faculty_etd Part of the Information Security Commons Recommended Citation Hawthorne, Daniel, "A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility" (2018). West Point ETD. 9. https://digitalcommons.usmalibrary.org/faculty_etd/9 This Doctoral Dissertation is brought to you for free and open access by USMA Digital Commons. It has been accepted for inclusion in West Point ETD by an authorized administrator of USMA Digital Commons. For more information, please contact [email protected]. A QUANTITATIVE STUDY OF ADVANCED ENCRYPTION STANDARD PERFORMANCE AS IT RELATES TO CRYPTOGRAPHIC ATTACK FEASIBILITY A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree of Doctor of Computer Science By Daniel Stephen Hawthorne Colorado Technical University December, 2018 Committee Dr. Richard Livingood, Ph.D., Chair Dr. Kelly Hughes, DCS, Committee Member Dr. James O. Webb, Ph.D., Committee Member December 17, 2018 © Daniel Stephen Hawthorne, 2018 1 Abstract The advanced encryption standard (AES) is the premier symmetric key cryptosystem in use today. Given its prevalence, the security provided by AES is of utmost importance. Technology is advancing at an incredible rate, in both capability and popularity, much faster than its rate of advancement in the late 1990s when AES was selected as the replacement standard for DES. Although the literature surrounding AES is robust, most studies fall into either theoretical or practical yet infeasible.
    [Show full text]
  • LNCS 7215, Pp
    ACoreCalculusforProvenance Umut A. Acar1,AmalAhmed2,JamesCheney3,andRolyPerera1 1 Max Planck Institute for Software Systems umut,rolyp @mpi-sws.org { 2 Indiana} University [email protected] 3 University of Edinburgh [email protected] Abstract. Provenance is an increasing concern due to the revolution in sharing and processing scientific data on the Web and in other computer systems. It is proposed that many computer systems will need to become provenance-aware in order to provide satisfactory accountability, reproducibility,andtrustforscien- tific or other high-value data. To date, there is not a consensus concerning ap- propriate formal models or security properties for provenance. In previous work, we introduced a formal framework for provenance security and proposed formal definitions of properties called disclosure and obfuscation. This paper develops a core calculus for provenance in programming languages. Whereas previous models of provenance have focused on special-purpose languages such as workflows and database queries, we consider a higher-order, functional language with sums, products, and recursive types and functions. We explore the ramifications of using traces based on operational derivations for the purpose of comparing other forms of provenance. We design a rich class of prove- nance views over traces. Finally, we prove relationships among provenance views and develop some solutions to the disclosure and obfuscation problems. 1Introduction Provenance, or meta-information about the origin, history, or derivation of an object, is now recognized as a central challenge in establishing trust and providing security in computer systems, particularly on the Web. Essentially, provenance management in- volves instrumenting a system with detailed monitoring or logging of auditable records that help explain how results depend on inputs or other (sometimes untrustworthy) sources.
    [Show full text]
  • Classical Encryption Techniques
    CPE 542: CRYPTOGRAPHY & NETWORK SECURITY Chapter 2: Classical Encryption Techniques Dr. Lo’ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Dr. Lo’ai Tawalbeh Fall 2005 Introduction Basic Terminology • plaintext - the original message • ciphertext - the coded message • key - information used in encryption/decryption, and known only to sender/receiver • encipher (encrypt) - converting plaintext to ciphertext using key • decipher (decrypt) - recovering ciphertext from plaintext using key • cryptography - study of encryption principles/methods/designs • cryptanalysis (code breaking) - the study of principles/ methods of deciphering ciphertext Dr. Lo’ai Tawalbeh Fall 2005 1 Cryptographic Systems Cryptographic Systems are categorized according to: 1. The operation used in transferring plaintext to ciphertext: • Substitution: each element in the plaintext is mapped into another element • Transposition: the elements in the plaintext are re-arranged. 2. The number of keys used: • Symmetric (private- key) : both the sender and receiver use the same key • Asymmetric (public-key) : sender and receiver use different key 3. The way the plaintext is processed : • Block cipher : inputs are processed one block at a time, producing a corresponding output block. • Stream cipher: inputs are processed continuously, producing one element at a time (bit, Dr. Lo’ai Tawalbeh Fall 2005 Cryptographic Systems Symmetric Encryption Model Dr. Lo’ai Tawalbeh Fall 2005 2 Cryptographic Systems Requirements • two requirements for secure use of symmetric encryption: 1. a strong encryption algorithm 2. a secret key known only to sender / receiver •Y = Ek(X), where X: the plaintext, Y: the ciphertext •X = Dk(Y) • assume encryption algorithm is known •implies a secure channel to distribute key Dr.
    [Show full text]
  • Block Ciphers and the Data Encryption Standard
    Lecture 3: Block Ciphers and the Data Encryption Standard Lecture Notes on “Computer and Network Security” by Avi Kak ([email protected]) January 26, 2021 3:43pm ©2021 Avinash Kak, Purdue University Goals: To introduce the notion of a block cipher in the modern context. To talk about the infeasibility of ideal block ciphers To introduce the notion of the Feistel Cipher Structure To go over DES, the Data Encryption Standard To illustrate important DES steps with Python and Perl code CONTENTS Section Title Page 3.1 Ideal Block Cipher 3 3.1.1 Size of the Encryption Key for the Ideal Block Cipher 6 3.2 The Feistel Structure for Block Ciphers 7 3.2.1 Mathematical Description of Each Round in the 10 Feistel Structure 3.2.2 Decryption in Ciphers Based on the Feistel Structure 12 3.3 DES: The Data Encryption Standard 16 3.3.1 One Round of Processing in DES 18 3.3.2 The S-Box for the Substitution Step in Each Round 22 3.3.3 The Substitution Tables 26 3.3.4 The P-Box Permutation in the Feistel Function 33 3.3.5 The DES Key Schedule: Generating the Round Keys 35 3.3.6 Initial Permutation of the Encryption Key 38 3.3.7 Contraction-Permutation that Generates the 48-Bit 42 Round Key from the 56-Bit Key 3.4 What Makes DES a Strong Cipher (to the 46 Extent It is a Strong Cipher) 3.5 Homework Problems 48 2 Computer and Network Security by Avi Kak Lecture 3 Back to TOC 3.1 IDEAL BLOCK CIPHER In a modern block cipher (but still using a classical encryption method), we replace a block of N bits from the plaintext with a block of N bits from the ciphertext.
    [Show full text]
  • 1 Perfect Secrecy of the One-Time Pad
    1 Perfect secrecy of the one-time pad In this section, we make more a more precise analysis of the security of the one-time pad. First, we need to define conditional probability. Let’s consider an example. We know that if it rains Saturday, then there is a reasonable chance that it will rain on Sunday. To make this more precise, we want to compute the probability that it rains on Sunday, given that it rains on Saturday. So we restrict our attention to only those situations where it rains on Saturday and count how often this happens over several years. Then we count how often it rains on both Saturday and Sunday. The ratio gives an estimate of the desired probability. If we call A the event that it rains on Saturday and B the event that it rains on Sunday, then the intersection A ∩ B is when it rains on both days. The conditional probability of A given B is defined to be P (A ∩ B) P (B | A)= , P (A) where P (A) denotes the probability of the event A. This formula can be used to define the conditional probability of one event given another for any two events A and B that have probabilities (we implicitly assume throughout this discussion that any probability that occurs in a denominator has nonzero probability). Events A and B are independent if P (A ∩ B)= P (A) P (B). For example, if Alice flips a fair coin, let A be the event that the coin ends up Heads. If Bob rolls a fair six-sided die, let B be the event that he rolls a 3.
    [Show full text]
  • Constructing Low-Weight Dth-Order Correlation-Immune Boolean Functions Through the Fourier-Hadamard Transform Claude Carlet and Xi Chen*
    1 Constructing low-weight dth-order correlation-immune Boolean functions through the Fourier-Hadamard transform Claude Carlet and Xi Chen* Abstract The correlation immunity of Boolean functions is a property related to cryptography, to error correcting codes, to orthogonal arrays (in combinatorics, which was also a domain of interest of S. Golomb) and in a slightly looser way to sequences. Correlation-immune Boolean functions (in short, CI functions) have the property of keeping the same output distribution when some input variables are fixed. They have been widely used as combiners in stream ciphers to allow resistance to the Siegenthaler correlation attack. Very recently, a new use of CI functions has appeared in the framework of side channel attacks (SCA). To reduce the cost overhead of counter-measures to SCA, CI functions need to have low Hamming weights. This actually poses new challenges since the known constructions which are based on properties of the Walsh-Hadamard transform, do not allow to build unbalanced CI functions. In this paper, we propose constructions of low-weight dth-order CI functions based on the Fourier- Hadamard transform, while the known constructions of resilient functions are based on the Walsh-Hadamard transform. We first prove a simple but powerful result, which makes that one only need to consider the case where d is odd in further research. Then we investigate how constructing low Hamming weight CI functions through the Fourier-Hadamard transform (which behaves well with respect to the multiplication of Boolean functions). We use the characterization of CI functions by the Fourier-Hadamard transform and introduce a related general construction of CI functions by multiplication.
    [Show full text]
  • Sabermetrics: the Past, the Present, and the Future
    Sabermetrics: The Past, the Present, and the Future Jim Albert February 12, 2010 Abstract This article provides an overview of sabermetrics, the science of learn- ing about baseball through objective evidence. Statistics and baseball have always had a strong kinship, as many famous players are known by their famous statistical accomplishments such as Joe Dimaggio’s 56-game hitting streak and Ted Williams’ .406 batting average in the 1941 baseball season. We give an overview of how one measures performance in batting, pitching, and fielding. In baseball, the traditional measures are batting av- erage, slugging percentage, and on-base percentage, but modern measures such as OPS (on-base percentage plus slugging percentage) are better in predicting the number of runs a team will score in a game. Pitching is a harder aspect of performance to measure, since traditional measures such as winning percentage and earned run average are confounded by the abilities of the pitcher teammates. Modern measures of pitching such as DIPS (defense independent pitching statistics) are helpful in isolating the contributions of a pitcher that do not involve his teammates. It is also challenging to measure the quality of a player’s fielding ability, since the standard measure of fielding, the fielding percentage, is not helpful in understanding the range of a player in moving towards a batted ball. New measures of fielding have been developed that are useful in measuring a player’s fielding range. Major League Baseball is measuring the game in new ways, and sabermetrics is using this new data to find better mea- sures of player performance.
    [Show full text]
  • Ohio IT Standard ITS-SEC-01 Data Encryption and Cryptography
    Statewide Standard State of Ohio IT Standard Standard Number: Title: ITS-SEC-01 Data Encryption and Cryptography Effective Date: Issued By: 03/12/2021 Ervan D. Rodgers II, Assistant Director/State Chief Information Officer Office of Information Technology Ohio Department of Administrative Services Version Identifier: Published By: 2.0 Investment and Governance Division Ohio Office of Information Technology 1.0 Purpose This state IT standard defines the minimum requirements for cryptographic algorithms that are cryptographically strong and are used in security services that protect at-risk or sensitive data as defined and required by agency or State policy, standard or rule. This standard does not classify data elements; does not define the security schemes and mechanisms for devices such as tape backup systems, storage systems, mobile computers or removable media; and does not identify or approve secure transmission protocols that may be used to implement security requirements. 2.0 Scope Pursuant to Ohio Administrative Policy IT-01, “Authority of the State Chief Information Officer to Establish Ohio IT Policy,” this state IT standard is applicable to every organized body, office, or agency established by the laws of the state for the exercise of any function of state government except for those specifically exempted. 3.0 Background The National Institute for Science and Technology (NIST) conducts extensive research and development in cryptography techniques. Their publications include technical standards for data encryption, digital signature and message authentication as well as guidelines for implementing information security and managing cryptographic keys. These standards and guidelines have been mandated for use in federal agencies and adopted by state governments and private enterprises.
    [Show full text]
  • 9 Purple 18/2
    THE CONCORD REVIEW 223 A VERY PURPLE-XING CODE Michael Cohen Groups cannot work together without communication between them. In wartime, it is critical that correspondence between the groups, or nations in the case of World War II, be concealed from the eyes of the enemy. This necessity leads nations to develop codes to hide their messages’ meanings from unwanted recipients. Among the many codes used in World War II, none has achieved a higher level of fame than Japan’s Purple code, or rather the code that Japan’s Purple machine produced. The breaking of this code helped the Allied forces to defeat their enemies in World War II in the Pacific by providing them with critical information. The code was more intricate than any other coding system invented before modern computers. Using codebreaking strategy from previous war codes, the U.S. was able to crack the Purple code. Unfortunately, the U.S. could not use its newfound knowl- edge to prevent the attack at Pearl Harbor. It took a Herculean feat of American intellect to break Purple. It was dramatically intro- duced to Congress in the Congressional hearing into the Pearl Harbor disaster.1 In the ensuing years, it was discovered that the deciphering of the Purple Code affected the course of the Pacific war in more ways than one. For instance, it turned out that before the Americans had dropped nuclear bombs on Japan, Purple Michael Cohen is a Senior at the Commonwealth School in Boston, Massachusetts, where he wrote this paper for Tom Harsanyi’s United States History course in the 2006/2007 academic year.
    [Show full text]
  • State of the Art in Lightweight Symmetric Cryptography
    State of the Art in Lightweight Symmetric Cryptography Alex Biryukov1 and Léo Perrin2 1 SnT, CSC, University of Luxembourg, [email protected] 2 SnT, University of Luxembourg, [email protected] Abstract. Lightweight cryptography has been one of the “hot topics” in symmetric cryptography in the recent years. A huge number of lightweight algorithms have been published, standardized and/or used in commercial products. In this paper, we discuss the different implementation constraints that a “lightweight” algorithm is usually designed to satisfy. We also present an extensive survey of all lightweight symmetric primitives we are aware of. It covers designs from the academic community, from government agencies and proprietary algorithms which were reverse-engineered or leaked. Relevant national (nist...) and international (iso/iec...) standards are listed. We then discuss some trends we identified in the design of lightweight algorithms, namely the designers’ preference for arx-based and bitsliced-S-Box-based designs and simple key schedules. Finally, we argue that lightweight cryptography is too large a field and that it should be split into two related but distinct areas: ultra-lightweight and IoT cryptography. The former deals only with the smallest of devices for which a lower security level may be justified by the very harsh design constraints. The latter corresponds to low-power embedded processors for which the Aes and modern hash function are costly but which have to provide a high level security due to their greater connectivity. Keywords: Lightweight cryptography · Ultra-Lightweight · IoT · Internet of Things · SoK · Survey · Standards · Industry 1 Introduction The Internet of Things (IoT) is one of the foremost buzzwords in computer science and information technology at the time of writing.
    [Show full text]
  • Girls' Elite 2 0 2 0 - 2 1 S E a S O N by the Numbers
    GIRLS' ELITE 2 0 2 0 - 2 1 S E A S O N BY THE NUMBERS COMPARING NORMAL SEASON TO 2020-21 NORMAL 2020-21 SEASON SEASON SEASON LENGTH SEASON LENGTH 6.5 Months; Dec - Jun 6.5 Months, Split Season The 2020-21 Season will be split into two segments running from mid-September through mid-February, taking a break for the IHSA season, and then returning May through mid- June. The season length is virtually the exact same amount of time as previous years. TRAINING PROGRAM TRAINING PROGRAM 25 Weeks; 157 Hours 25 Weeks; 156 Hours The training hours for the 2020-21 season are nearly exact to last season's plan. The training hours do not include 16 additional in-house scrimmage hours on the weekends Sep-Dec. Courtney DeBolt-Slinko returns as our Technical Director. 4 new courts this season. STRENGTH PROGRAM STRENGTH PROGRAM 3 Days/Week; 72 Hours 3 Days/Week; 76 Hours Similar to the Training Time, the 2020-21 schedule will actually allow for a 4 additional hours at Oak Strength in our Sparta Science Strength & Conditioning program. These hours are in addition to the volleyball-specific Training Time. Oak Strength is expanding by 8,800 sq. ft. RECRUITING SUPPORT RECRUITING SUPPORT Full Season Enhanced Full Season In response to the recruiting challenges created by the pandemic, we are ADDING livestreaming/recording of scrimmages and scheduled in-person visits from Lauren, Mikaela or Peter. This is in addition to our normal support services throughout the season. TOURNAMENT DATES TOURNAMENT DATES 24-28 Dates; 10-12 Events TBD Dates; TBD Events We are preparing for 15 Dates/6 Events Dec-Feb.
    [Show full text]