Course Search | Main

MA464 COURSE DETAILS


2 Version(s) of this Course

MA464 (Version: 2013 2) COURSE DETAILS


COURSE TITLE EFF YEAR EFF TERM DEPARTMENT CREDIT HOURS
MA464 APPLIED ALGEBRA W/ CRYPTOLOGY 2013 2 Mathematical Sciences 3.0 (BS=0.0, ET=0.0, MA=3.0)
SCOPE
We study the underlying algebra of computer science structures as well as sets, set functions, Boolean algebra, finite state machines, groups, and modular arithmetic. We introduce and study mathematical aspects of cryptology with an emphasis on cryptanalysis of encryption ciphers. We study early paper-and-pencil systems through current computer algorithms for encryption. We employ algebraic principles in both design and analysis of encryption systems, be it matrix, linear feedback shift register sequence, or linear congruential random number generator sequence efforts. Further, we investigate the mathematics of breaking machine ciphers and of designing modern public-key crypto systems.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
None

MA464 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  MA206 1992 1 1 Y
  MA256 2018 2 2 Y
  MA206X 2017 2 3 Y

MA464 (Version 2013-2) COURSE OFFERINGS


AYT #SECT/SIZE CPBLTY ENRLD WAIT SEATS CLOSED DETAILS
2025 - 2 2 18 36 24 0 12 N Hours
2026 - 2 2 18 36 21 0 15 N Hours
2027 - 2 2 18 36 15 0 21 N Hours
2028 - 2 2 18 36 1 0 35 N Hours

MA464 (Version: 2003 2) COURSE DETAILS (ARCHIVED)


COURSE TITLE EFF YEAR EFF TERM DEPARTMENT CREDIT HOURS
MA464 APPLIED ALGEBRA W/ CRYPTOLOGY 2003 2 Mathematical Sciences 3.0 (BS=0.0, ET=0.0, MA=0.0)
SCOPE
We study the underlying algebra of computer science structures as well as sets, set functions, Boolean algebra, finite state machines, groups, and modular arithmetic. We introduce and study mathematical aspects of cryptology with an emphasis on cryptanalysis of encryption ciphers. We study early paper-and-pencil systems through current computer algorithms for encryption. We employ algebraic principles in both design and analysis of encryption systems, be it matrix, linear feedback shift register sequence, or linear congruential random number generator sequence efforts. Further, we investigate the mathematics of breaking machine ciphers and of designing modern public-key crypto systems.
LESSONS: 40 @ 55 min (2.500 Att/wk) LABS: 0 @ 0 min
SPECIAL REQUIREMENTS:
None

MA464 COURSE REQUISITES


TYPE COURSE EFF YEAR EFF TERM TRACK RED BOOK FLG
PRE REQUISITE  
  MA206 1992 1 1 Y