Study guide
13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs
Praxis Computer Science 5652
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Praxis 5652 Exam Overview and ETS Pseudocode
1.1 Praxis 5652 Test Facts, Scoring, and Registration 1.2 Official ETS Pseudocode Notation and Tracing Strategy
2 Chapter 2: Impacts of Computing: Innovation, Access, and Effects
2.1 Computing for Creativity, Problem Solving, Communication, and Innovation 2.2 Equal Access, the Digital Divide, and Accessibility 2.3 Beneficial and Harmful Effects of Computing Innovations
3 Chapter 3: Impacts of Computing: Intellectual Property, Ethics, Privacy, and Security
3.1 Intellectual Property: Copyright, Open Source, and Creative Commons 3.2 Ethical and Unethical Computing Practices and Their Implications 3.3 Privacy, Security, Data Collection, and Local vs. Cloud Storage
4 Chapter 4: Algorithms and Computational Thinking: Abstraction, Decomposition, Number Bases, and Representation
4.1 Abstraction and Abstraction Hierarchies 4.2 Decomposition, Pattern Recognition, and Developing Algorithms 4.3 Number Bases: Binary, Octal, Decimal, and Hexadecimal 4.4 Algorithm Formats: Natural Language, Flowcharts, Pseudocode, and Tracing
5 Chapter 5: Algorithms: Efficiency, Limits of Computing, and Randomization
5.1 Algorithm Efficiency: Linear, Quadratic, Exponential, and Logarithmic Growth 5.2 Limits of Computing: Unsolvable Problems, Intractability, and Heuristics 5.3 Randomization, Random vs. Pseudorandom Numbers, and Scaling to a Range
6 Chapter 6: Algorithms: Searching, Sorting, and Recursion
6.1 Searching Algorithms: Linear Search and Binary Search 6.2 Sorting Algorithms: Tracing, Comparisons, Correctness, and Efficiency 6.3 Recursion: Base Cases, Tracing, Errors, and Iterative Equivalents
7 Chapter 7: Programming: Variables, Data Types, Strings, and Expressions
7.1 Variables, Data Types, and Type Conversion 7.2 Strings and String Operations 7.3 Operators, Precedence, Expressions, and Formulas 7.4 Boolean Expressions, Truth Tables, and Boolean Algebra
8 Chapter 8: Programming: Selection, Iteration, and Writing Code
8.1 Sequence and Selection: if, else, Chained and Nested Conditions 8.2 Iteration: for, while, do … while, and repeat … until Loops 8.3 Reading, Completing, and Modifying Code
9 Chapter 9: Programming: Procedures, Arrays, and Data Structures
9.1 Procedures, Parameters, Return Values, Nested Calls, and Scope 9.2 Arrays, Lists, and Two-Dimensional Arrays 9.3 Stacks, Queues, and Dictionaries (Maps)
10 Chapter 10: Programming: Correctness, Errors, Testing, and Code Quality
10.1 Program Correctness: Preconditions, Postconditions, Invariants, and Testing vs. Proof 10.2 Error Types and Debugging Techniques 10.3 Choosing Useful Test Cases: Boundaries, Partitions, Coverage, and Regression 10.4 Extensibility, Modifiability, and Reusability: Constants and Parameterization 10.5 Documentation, Code Reviews, Peer Feedback, and End-User Feedback
11 Chapter 11: Programming: Events, Usability, Input Validation, and APIs
11.1 Event-Driven Programming, Asynchronous Events, and Concurrency 11.2 Usability, Meaningful Error Messages, and Input Validation vs. Verification 11.3 Libraries and APIs: Reading Definitions, Making Calls, and Weighing Trade-offs
12 Chapter 12: Programming: Languages, Tools, Paradigms, and Object-Oriented Design
12.1 Low- and High-Level Languages, Compilers and Interpreters, and IDEs 12.2 Programming Paradigms: Procedural, Object-Oriented, and Others 12.3 Classes, Objects, Instance Variables, Methods, and Encapsulation 12.4 Inheritance, Polymorphism, and Overloading vs. Overriding
13 Chapter 13: Data: Bits, Encoding, Compression, and Encryption
13.1 Bits and Bytes: Why Binary, Storage Calculations, and Signed Integers 13.2 Encoding Text, Images, and Sound 13.3 Lossless and Lossy Compression: Run-Length Encoding, Huffman Coding, and Media Formats 13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs
14 Chapter 14: Data: Analysis Tools, Simulation, Storage, and Collection
14.1 Analyzing Data with Spreadsheets: Cleaning, Transforming, and Visualizing 14.2 Simulation and Modeling 14.3 Files, Databases, and Storage Requirements: Scale, Redundancy, and Backup 14.4 Collecting, Aggregating, and Generating Data: Public Data Sets, Surveys, Sensors, and Crowdsourcing
15 Chapter 15: Computing Systems: Hardware, Operating Systems, and Computing Environments
15.1 Hardware Components and the Fetch–Decode–Execute Cycle 15.2 Operating Systems, Software Components, and Resource Issues 15.3 Embedded Systems, the Internet of Things, and Types of Computing Systems 15.4 Local, Network, and Cloud Computing and Storage; How Binary Data Are Stored
16 Chapter 16: Networks, the Internet, the Web, and Cybersecurity
16.1 Network Types and Wired and Wireless Communication 16.2 Network Hardware and Layered Network Models (OSI and TCP/IP) 16.3 Network Performance: Bandwidth, Latency, Load, and Estimating Needs 16.4 How the Internet Works: Protocols, IP Addressing, DNS, URLs, and Reliability 16.5 The Web: HTTP, HTML and Markup Languages, Browsers, Servers, and Clients 16.6 Cybersecurity: The Five Pillars, Strong Passwords, Security Strategies, and Trade-offs
13.4 Encoding vs. Encryption, Symmetric and Public-Key Encryption, and Their Trade-offs
Key Takeaways Explain This Topic AI
Encoding transforms data into another format using a publicly known scheme, such as ASCII, Base64, or Morse code; anyone can decode it, so it provides no secrecy.
Encryption transforms plaintext into ciphertext using an algorithm and a secret key; without the correct key, the ciphertext should be unreadable.
Symmetric encryption, such as AES, uses one shared key and is fast; public-key (asymmetric) encryption, such as RSA, uses a public and private key pair, which solves key distribution but is slower.
A cryptographic hash is a one-way fingerprint of data used to check integrity and to store passwords; it is not meant to be decrypted.
Trade-offs of encryption include extra computation and latency, key management burden, permanent data loss if keys are lost, and reduced ability to inspect or search data.
Last updated: September 2026
What this competency asks
ETS asks you to be familiar with concepts of data encryption and decryption :
Distinguish between encoding and encryption.
Identify trade-offs in the use of data encryption.
A discussion question asks for examples of each and an explanation of the difference.
Encoding vs. encryption
Encoding Encryption
Purpose Represent data in a form suitable for storage, transmission, or compatibility Keep data confidential from unauthorized parties
- Scheme Public and standardized The algorithm is usually public; the key is secret
- Reversible by Anyone who knows the scheme Only someone with the correct key
- Security None Strong if the algorithm and key are strong
Examples ASCII, UTF-8, Base64, URL encoding ( %20 for a space), Morse code, barcodes AES, RSA, HTTPS traffic, encrypted phone storage
The classic mistake is thinking Base64 hides a password. cGFzc3dvcmQ= looks scrambled, but any Base64 decoder instantly turns it back into password . Encoding changes form . Encryption protects meaning .
Two relatives of encryption to keep separate:
Compression (Section 13.3) makes data smaller, and anyone can decompress it.
Hashing is one-way: it produces a fixed-size fingerprint that cannot be reversed. It checks integrity and stores passwords.
How encryption works
Plaintext + key → encryption algorithm → ciphertext . The reverse process, with the right key, is decryption .
A classic example: the Caesar cipher
Shift each letter a fixed number of places. The shift amount is the key. With a shift of 3:
- Plain A B C … H E L L O
- Cipher D E F … K H O O R
"HELLO" encrypts to "KHOOR". To decrypt, shift back by 3: "FDW" becomes "CAT". A Caesar cipher is trivially broken because there are only 25 useful shifts, but it shows the roles of the algorithm (shifting) and the secret key (the amount).
Symmetric encryption
One shared secret key encrypts and decrypts.
Examples: AES (the Advanced Encryption Standard, with 128-, 192-, or 256-bit keys) is the current standard. DES, with only 56-bit keys, is obsolete because it can be broken by trying every key.
Strength: fast, which suits bulk data such as disks, files, and network streams.
Weakness: the key distribution problem . How do two parties who have never met share the secret key safely? And every pair of users needs its own key: n people need n(n − 1)/2 keys.
Public-key (asymmetric) encryption
Each person has a key pair : a public key that anyone may have, and a private key kept secret.
To send Bob a secret, encrypt with Bob's public key . Only Bob's private key can decrypt it.
Examples: RSA, which relies on the difficulty of factoring very large numbers, and elliptic-curve cryptography.
Strength: no shared secret has to be exchanged in advance.
Weakness: much slower than symmetric encryption.
Hybrid systems get both benefits. HTTPS uses public-key cryptography to authenticate the server and agree on a fresh symmetric session key , then uses fast symmetric encryption for the rest of the connection. Private keys also create digital signatures , which prove authorship and integrity (Section 16.6).
Hashing for integrity and passwords
A cryptographic hash function (such as SHA-256) turns any input into a fixed-size digest:
The same input always gives the same digest.
A tiny change to the input produces a completely different digest.
It is infeasible to reverse the digest, or to find two inputs with the same digest.
Uses: checking that a download was not altered (compare its hash with the published hash), and password storage . Systems should store a salted hash of each password, computed with a deliberately slow password-hashing algorithm such as bcrypt or Argon2, never the password itself. MD5 and SHA-1 are considered broken for security purposes.
Trade-offs in using encryption
Benefit Cost or risk
Confidentiality of data at rest (stored) and in transit (sent) Performance: extra computation, battery use, and latency
Protection if a device is lost or stolen Key management: keys must be generated, stored, rotated, and backed up securely
Compliance with privacy laws and policies Data loss: if the key is lost, the data are gone for good
Protection on untrusted networks such as public Wi-Fi Harder inspection: encrypted traffic can hide malware from network filters, and encrypted data cannot easily be searched
Integrity and authenticity (with signatures) Usability: passwords, recovery keys, and multi-step access add friction
Legal and policy tension: debates over lawful access to encrypted devices
Stronger settings, such as longer keys and more encryption, increase security but also increase cost. Choosing encryption means balancing the value and sensitivity of the data against these costs. For student records and passwords, the balance clearly favors strong encryption.