en
James Forshaw

Attacking Network Protocols

Benachrichtigen, wenn das Buch hinzugefügt wird
Um dieses Buch zu lesen laden Sie eine EPUB- oder FB2-Datei zu Bookmate hoch. Wie lade ich ein Buch hoch?
Dieses Buch ist zurzeit nicht verfügbar
545 Druckseiten
Haben Sie es bereits gelesen? Was halten sie davon?
👍👎

Ersteindruck

  • Максим Павловhat einen Ersteindruck geteiltvor 6 Jahren
    💡Viel gelernt

Zitate

  • Максим Павловhat Zitat gemachtvor 6 Jahren
    To complete this hierarchy, valid certificates must contain at least four pieces of information:

    • The subject, which specifies the identity for the certificate

    • The subject’s public key

    • The issuer, which identifies the signing certificate

    • A valid signature applied over the certificate and authenticated by the issuer’s private key
  • Максим Павловhat Zitat gemachtvor 6 Jahren
    X.509 certificates are used to verify web servers, sign executable programs, or authenticate to a network service. Trust is provided through a hierarchy of certificates using asymmetric signature algorithms, such as RSA and DSA.
  • Максим Павловhat Zitat gemachtvor 6 Jahren
    For a hashing algorithm to be suitable for cryptographic purposes, it has to fulfill three requirements:

    Pre-image resistance Given a hash value, it should be difficult (such as by requiring a massive amount of computing power) to recover a message.

    Collision resistance It should be difficult to find two different messages that hash to the same value.

    Nonlinearity It should be difficult to create a message that hashes to any given value.

    A number of hashing algorithms are available, but the most common are members of either the Message Digest (MD) or Secure Hashing Algorithm (SHA) families. The Message Digest family includes the MD4 and MD5 algorithms, which were developed by Ron Rivest. The SHA family, which contains the SHA-1 and SHA-2 algorithms, among others, is published by NIST.

In Regalen

fb2epub
Ziehen Sie Ihre Dateien herüber (nicht mehr als fünf auf einmal)