1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
kifflom [539]
3 years ago
11

Secure Hashing Algorithm (SHA) is an algorithm for generating cryptographically secure one-way hash, published by the National I

nstitute of Standards and Technology as a U.S. Federal Information Processing Standard. What is the block (word) size used by SHA-512 algorithm?
32-bit
64-bit
128-bit
256-bit
Computers and Technology
1 answer:
Naily [24]3 years ago
8 0

Answer:

64 byte.

It's not bit is byte.

Explanation:

Secure Hash Algorithms (SHA) :- These are a family of cryptographic hash functions. There are basically four types of secure hash algorithms for generating cryptographically secure one-way hash.They are as following:-

SHA-0

SHA-1

SHA-2

SHA-3

SHA -2 consists of SHA-512 and the block size used by it is 64 byte or 512 bits.

You might be interested in
What is an example of a reputable website
Keith_Richards [23]
A reputable website would be one that you could research online and read about it's history , reviews etc .
4 0
3 years ago
Read 2 more answers
Which kind of image is indispensable and needs added text to go with it
grigory [225]
It may be an image that is on the internet, without a caption visually impaired will not understand
7 0
3 years ago
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the pag
kompoz [17]

Answer:

C. FIFO

Explanation:

The first-in, first-out (FIFO) page replacement algorithm is a low-overhead algorithm that requires work on the part of the operating system. On a page fault, the frame that has been in memory the longest is replaced.

Using FIFO algorithm implies that

a page which was brought into memory first will be removed first since variable was initialized very early. it is in the set of first in pages that will be removed.

It is the simplest page replacement algorithm. The operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal that is first in first out.

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is called First In First Out.

7 0
3 years ago
An anchor tag can be coded using which two attributes?
IceJOKER [234]

Answer:

21212122121221212211212121212212121Explanation:

4 0
2 years ago
You're using disk management to view primary and extended partitions on a suspect's drive. the program reports the extended part
kodGreya [7K]

The best assumption to make is that there is a hidden partition and the drive needs to be further searched.

5 0
3 years ago
Other questions:
  • NEED HELP(10 POINTS) PLEASE HELP MATH
    8·2 answers
  • Select the correct statement below about database services or database instances:
    5·1 answer
  • Which of the following is a malicious program that can replicate and spread from computer to computer?
    13·2 answers
  • Tortise and hare race java g Modify the main class so it runs the race 100 times and reports how many times each runner wins. (T
    7·1 answer
  • What is the first structure of a pascal program?
    5·1 answer
  • Remote wiping is a device security control that allows an organization to remotely erase data or email in the event of loss or t
    10·2 answers
  • The Counter Pattern
    14·1 answer
  • What is the setting an alarm clock output??
    10·1 answer
  • How to make a 'Sign in with replit' button in replit (Node.js) will make brainliest
    12·2 answers
  • write an algorithm to determine a student's final grade and indicate whether it is passing or failing. the final grade is calcul
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!