## Fundamentals of Computer SecurityThis reference work looks at modern concepts of computer security. It introduces the basic mathematical background necessary to follow computer security concepts before moving on to modern developments in cryptography. The concepts are presented clearly and illustrated by numerous examples. Subjects covered include: private-key and public-key encryption, hashing, digital signatures, authentication, secret sharing, group-oriented cryptography, and many others. The section on intrusion detection and access control provide examples of security systems implemented as a part of operating system. Database and network security is also discussed. The final chapters introduce modern e- business systems based on digital cash. |

### What people are saying - Write a review

#### L33t agenda

User Review - Apprentice31337 - BordersIf you want to know all basics of cryptographic systems and are planning on getting into the field of computer security, either working as a white hat or a general computer security enthusiast, this ... Read full review

User Review - Flag as inappropriate

I don't even know why someone would waste their time to read this...

### Contents

Introduction | 1 |

Background Theory | 11 |

PrivateKey Cryptosystems | 69 |

PublicKey Cryptosystems | 171 |

Pseudorandomness | 219 |

Hashing | 243 |

Digital Signatures | 283 |

Authentication | 307 |

ZeroKnowledge Proof Systems | 409 |

Identification | 433 |

Intrusion Detection | 459 |

Electronic Elections and Digital Money | 499 |

Database Protection and Security | 525 |

Access Control | 565 |

Network Security | 591 |

631 | |

### Other editions - View all

Fundamentals of Computer Security Josef Pieprzyk,Thomas Hardjono,Jennifer Seberry Limited preview - 2013 |

Fundamentals of Computer Security Josef Pieprzyk,Thomas Hardjono,Jennifer Seberry No preview available - 2014 |

Fundamentals of Computer Security Josef Pieprzyk,Thomas Hardjono,Jennifer Seberry No preview available - 2010 |

### Common terms and phrases

A-code access control access structure Alice applies Assume attack authentication bent functions bits Boolean function channel checks chooses cipher ciphertext collection commitment scheme computes congruence Consider creates cryptanalysis cryptogram database systems decryption defined discrete logarithm distributed element ElGamal elliptic curve encryption algorithm ensemble factors Feistel function f GF(p given hash function host identification implementation input instance integer interaction intrusion detection inverse iterations Jacobi symbol linear matrix mod q modulus multiple object one-way function operating system oracle Oscar output pair parameters participants password permutation plaintext polynomial polynomial-time prime probabilistic probabilistic encryption probability problem proof protocol prover pseudorandom public key quadratic residue random integer round S-box Sally secret key secret sharing selects sequence server Shamir string subset Theorem unicity distance valid vector verifier virus viruses voters zero-knowledge zero-knowledge proof

### Popular passages

Page 633 - R. Bird, I. Gopal, A. Herzberg, P. Janson, S. Kutten, R. Molva, and M. Yung. Systematic Design of Two-Party Authentication Protocols.