Computer Science: An OverviewIntroduction to Computer Science Computer Science: An Overview, Ninth Edition J. Glenn Brookshear, "Marquette University" Do you want your students to gain a fundamental understanding of the field of computer science? Would you like them to be excited by the opportunities computing presents for further studies and future careers? "Computer Science: An Overview "delivers a foundational framework of what computer science is all about. Each topic is presented with a historical perspective, its current state, and its future potential, as well as ethical issues for students to consider. This balanced, realistic picture helps students see that their future success depends on a solid overview in the rapidly changing field of computer science. Features:
|
From inside the book
Results 1-3 of 24
Page 184
... encryption systems used within the Inter- net are based on the RSA algorithm , named after its inventors Ron Rivest , Adi Shamir , and Len Adleman , which we will discuss in detail at the end of Chapter 11. RSA techniques ( among others ) ...
... encryption systems used within the Inter- net are based on the RSA algorithm , named after its inventors Ron Rivest , Adi Shamir , and Len Adleman , which we will discuss in detail at the end of Chapter 11. RSA techniques ( among others ) ...
Page 185
... encryption system and gives both Alice and Carol the public key , then both Alice and Carol can encrypt messages to Bob , but they cannot spy on the other's communication . Indeed , if Carol intercepts a message from Alice , she cannot ...
... encryption system and gives both Alice and Carol the public key , then both Alice and Carol can encrypt messages to Bob , but they cannot spy on the other's communication . Indeed , if Carol intercepts a message from Alice , she cannot ...
Page 515
... encryption system based on the RSA algorithm . First we pick two distinct prime numbers p and q , whose prod- uct we will represent by n . Then we pick two other positive integers e and d such that ex d k ( p − 1 ) ( q − 1 ) + 1 , for ...
... encryption system based on the RSA algorithm . First we pick two distinct prime numbers p and q , whose prod- uct we will represent by n . Then we pick two other positive integers e and d such that ex d k ( p − 1 ) ( q − 1 ) + 1 , for ...
Contents
Introduction | 1 |
Data Manipulation | 79 |
Networking and the Internet | 147 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
activities application application software Apply the procedure approach assigned binary search binary search algorithm bit pattern browser byte called Carol Chapter client communication components computer science consider containing data type database described diagram digits disk document domain employee encoded encryption entry example executed Figure goal hexadecimal identify implemented input insertion sort instruction integer Internet linked loop machine language machine's main memory mass storage means memory cell network layer node notation object-oriented operating system output perform pointer problem procedure Search produce program counter programming languages protocol pseudocode Questions & Exercises record recursive representation represented requests result retrieve Section sequence sequential server software engineering solving sort algorithm stack statement steps stored structure Suppose TargetValue task techniques TestEntry tion transferred transport layer tree Turing Turing machine two's complement unit variable