Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 4 out of 1146 pages
Exam (elaborations)

COMPUTER SECURITY PRINCIPLES AND PRACTICE Fourth Edition by William Stallings & Lawrie Brown

Document preview thumbnail
Preview 4 out of 1146 pages

2.1 Suppose someone suggests the following way to confirm that the two of you are both in possession of the same secret key. You create a random bit string the length of the key, XOR it with the key, and send the result over the channel. Your partner XORs the incoming block with the key (which should be the same as your key) and sends it back. You check, and if what you receive is your original random string, you have verified that your partner has the same secret key, yet neither of you has ever transmitted the key. Is there a flaw in this scheme? 2.2 This problem uses a real-world example of a symmetric cipher, from an old U.S. Special Forces manual (public domain). The document, filename Special F, is available at a. Using the two keys (memory words) cryptographic and network security, encrypt the following message: Be at the third pillar from the left outside the lyceum theatre tonight at seven. If you are distrustful bring two friends. Make reasonable assumptions about how to treat redundant letters and excess letters in the memory words and how to treat spaces and punctuation. Indicate what your assumptions are. Note: The message is from the Sherlock Holmes novel The Sign of Four. b. Decrypt the ciphertext. Show your work. c. Comment on when it would be appropriate to use this technique and what itsadvantages are. 2.3 Consider a very simple symmetric block encryption algorithm, in which 64-bits blocks of plaintext are encrypted using a 128-bit key. Encryption is defined as C=(P K0) K1 where C=ciphertext; K=secret key; K0=leftmost 64 bits of K; K1=rightmost 64 bits of K, =bitwise exclusive or; and is addition mod 264. a. Show the decryption equation. That is, show the equation for P as a function of C, K1 and K2. b. Suppose an adversary has access to two sets of plaintexts and their correspondingciphertexts and wishes to determine K. We have the two equations: C=(P K0) K1; C′=(P′ K0) K1 First, derive an equation in one unknown (e.g., K0). Is it possible to proceed further to solve for K0? 2.4 Perhaps the simplest “serious” symmetric block encryption algorithm is the Tiny Encryption Algorithm (TEA). TEA operates on 64-bit blocks of plaintext using a 128-bit key. The plaintext is divided into two 32-bit blocks (L0, R0), and the key is divided into four 32bit blocks (K0, K1, K2, K3). Encryption involves repeated application of a pair of rounds, defined as follows for rounds i and i+1: Li=Ri−1Ri=Li−1 F(Ri−1, K0, K1, δi)Li+1=RiRi+1=Li F(Ri, K2, K3, δi+1) where F is defined as F(M, Kj, Kk, δi)=((M 4) Kj) ((M 5) Kk) (M+δi)

Content preview

, COMPUTER SECURITY PRINCIPLES AND PRACTICE
Fourth Edition

William Stallings
Lawrie Brown
UNSW Canberra at the Australian Defence Force Academy




330 Hudson Street, New York, NY 10013

,Director, Portfolio Management: Engineering, Computer Science & Global Editions: J
Partridge

Specialist, Higher Ed Portfolio Management: Tracy Johnson (Dunkelberger)

Portfolio Management Assistant: Meghan Jacoby

Managing Content Producer: Scott Disanno

Content Producer: Robert Engelhardt

Web Developer: Steve Wright

Rights and Permissions Manager: Ben Ferrini

Manufacturing Buyer, Higher Ed, Lake Side Communications Inc (LSC): Maura
ZaldivarGarcia

Inventory Manager: Ann Lam

Product Marketing Manager: Yvonne Vannatta

Field Marketing Manager: Demetrius Hall

Marketing Assistant: Jon Bryant

Cover Designer: Marta Samsel

Cover Photo: E+/Getty Images

Full-Service Project Management: Kirthika Raj, SPi Global

Credits and acknowledgments borrowed from other sources and reproduced, with permissio
this textbook appear on page 755.

Copyright © 2018, 2015, 2012, 2008 by Pearson Education, Inc., Pearson Education, Inc.,
Hoboken, New Jersey 07030 . All rights reserved. Manufactured in the United States of Ame
This publication is protected by Copyright, and permission should be obtained from the pub
prior to any prohibited reproduction, storage in a retrieval system, or transmission in any for
by any means, electronic, mechanical, photocopying, recording, or likewise. To obtain
permission(s) to use material from this work, please submit a written request to Pearson
Education, Inc., Permissions Department, Pearson Education, Inc., Hoboken, New Jersey 0

, Many of the designations by manufacturers and seller to distinguish their products are claim
trademarks. Where those designations appear in this book, and the publisher was aware of
trademark claim, the designations have been printed in initial caps or all caps.

Library of Congress Cataloging-in-Publication Data

Names: Stallings, William, author. | Brown, Lawrie, author.

Title: Computer security : principles and practice / William Stallings, Lawrie Brown, UNSW
Canberra at the Australian Defence Force Academy.

Description: Fourth edition. | Upper Saddle River, New Jersey : Pearson Education, Inc., [20
Includes bibliographical references and index.

Identifiers: LCCN 2017025135| ISBN 9780134794105 | ISBN 0134794109

Subjects: LCSH: Computer security. | Computer networks--Security measures.

Classification: LCC QA76.9.A25 S685 2017 | DDC 005.8--dc23 LC record available at
https://lccn.loc.gov/2017025135

1 17




ISBN-10: 0-13-479410-9

ISBN-13: 978-0-13-479410-5


CONTENTS
Cover

Title Page

Copyright

Dedication

ONLINE CHAPTERS AND APPENDICES

Preface xii

Notation xxi

About the Authors xxii

Connected book
 image
William Stallings, Lawrie Brown Computer Security
Publisher: 2018 ISBN: 9780134794105 Edition: Unknown

Document information

Uploaded on
June 9, 2024
Number of pages
1146
Written in
2023/2024
Type
Exam (elaborations)
Contains
Questions & answers
$26.49

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
DrJon
3.8
(160)
Sold
586
Followers
188
Items
20922
Last sold
2 days ago

Reviews from verified buyers



Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions