Cryptographic protocols

Sort By:
Page 8 of 50 - About 500 essays
  • Better Essays

    Above you see an extract from the log in page, showing the heavy dependence on $_SESSION variables. These are required so much because they allow other pages to access the data. If I just used local variables I’d have no ability to transfer data between pages, and this is necessary to keep track of things like who is logged in or if even anyone is logged in. All SQL queries come back as associative arrays too, with each column entry being an element in the array, so they are very prominent. There

    • 1604 Words
    • 7 Pages
    Better Essays
  • Decent Essays

    Fortunately, it is not necessary to type all file’s name. That is because “md5sum” command offers a feature that allows the user to compute a checksum for multiple files with same type or extension. All the user needs to do is to specify the format of the file within the [file] section in the command. Assume that there are four files in the current directory: “1.txt”, “2.txt”, “abc.iso” and “edf.iso”. If the user wants to compute the checksum for all “.txt” files under the current directory, the

    • 927 Words
    • 4 Pages
    Decent Essays
  • Good Essays

    MPUS: Brute-Force Algorithm Group Name: MPUS Members: Johann Redhead, Tellon Smith, Kevin Lord I Johann Redhead…………………, Tellon Smith…………………, and Kevin Lord…………………, agree to attempt and solve the proposed problem to the best of our abilities. Proposed Problem: Brute-force Algorithm SUMMARY Brute force is defined as very strong or forceful. In computer Science, this is essentially the same definition. Brute-force in Computer Science is the trial and error method used by application programs

    • 1001 Words
    • 5 Pages
    Good Essays
  • Decent Essays

    The initial one time password can be generated using an algorithm called OCRA (OATH challenge-response algorithm). OCRA is a challenge-response algorithm developed by Open Authentication (OATH) which generates a value, i.e. password with variable data input and not just incremented counter values. The variable input is a random number from the server. It is generalization of HOTP (HMAC one time password) algorithm. OCRA can be defined as: OCRA = CryptoFunction(K, DataInput) Where, K is the key shared

    • 984 Words
    • 4 Pages
    Decent Essays
  • Better Essays

    Privacy Preserving Trademark Identification System using Cloud 1. Introduction Content-Based Information Retrieval (CBIR) is the field that constitutes representation of images, organizing and searching of images based on their content rather than annotations of image. CBIR, also known as query by image content and content-based visual information retrieval (CBVIR) is the application of computer vision techniques to the image retrieval problem, that is, the matter of checking out digital pictures

    • 2147 Words
    • 9 Pages
    Better Essays
  • Decent Essays

    P r e e t V i m a l c h a n d J a i n P a g e | 1 Homework 3 CS 696 Network Management and Security Fall 2014 1. Have you thought more the project? How would you measure your success on the project? What are some concrete objectives and how much work do you think is involved? Yes I have thought more about the project as well searching and reading research papers so that I can get overview and understand the concepts in detail. I would measure it as it will help me to learn the skills of networking

    • 1766 Words
    • 8 Pages
    Decent Essays
  • Better Essays

    ADVANCED RAILWAY RESEVATION SYSTEM Jitesh Bhoir VIVA Institute of Technology Bhoir.jitesh12@ hotmail.com Malaika Mulla VIVA Institute of Technology malaikamulla.9218@ gmail.com Ragini Kale VIVA Institute of Technology raginikale10@ gmail.com Nikita Patil VIVA Institute of Technology nikita.patil@ vivacollege.org ABSTRACT In our country railways have become prominent. Our system consists of solution for reservation, planning and managing railway transportation. It includes the idea of

    • 1132 Words
    • 5 Pages
    Better Essays
  • Decent Essays

    are on the higher side. Since the applications are built on the sidechains, the failure of an application does not affect the Lisk network which is not the case in many other blockchain platforms. All aspects of the Lisk system is secured using cryptographic hash techniques. The EdDSA technique is adopted in Lisk as it does hashing fast and provide high security. Along with the security provided using public and private keypairs, additional security is provided using a second passphrase which has association

    • 973 Words
    • 4 Pages
    Decent Essays
  • Decent Essays

    Cryptograpy Exam

    • 655 Words
    • 3 Pages

    1. What are some threats associated with a direct digital signature scheme? a. The scheme validation is dependent on the security of the sender’s private key, which the sender can later claim lost or stolen and that the signature was forged when trying to deny sending a particular message. b. If a private key is stolen from Bob at time t, the thief can send a message signed with Bob’s signature with a time stamp equal to or less than t. c. The need for trust between 2 participants is a potential

    • 655 Words
    • 3 Pages
    Decent Essays
  • Decent Essays

    the fact it doesn’t require a centralized administrator and doesn’t require a fixed network infrastructure (base station/ access point). With the creation of Ad hoc networks came the problem of secure routing protocols for this type of network. Ariadne is one the secure routing protocol which was created to improve ad hoc networking security.

    • 1141 Words
    • 5 Pages
    Decent Essays