All categories

2 years ago

In an ethernet network, the signal that is sent to indicate a signal collision is called a ________ signal.

1 answer:

3 0

Hey there! Hello!

I'm certainly not an expert at anything related to ethernet, but I do believe that the answer you're looking for is a jam signal. To my limited understanding, <span>CSMA/CD makes computers "listen" before sending data to see if their signal is currently being used. If it's not, it'll send. The computer and sender will continue to "listen" to see if a jam still occurred afterwards. If one did occur, a jam signal will be sent to everyone who may send something over that signal, warning them not to send anything else, since it will not be successful and may make the jam worse.

Hope this helped you out! I would normally tell the question–askers that they can ask me any additional questions they may have, but... that's the extent that I know about ethernet, haha! :-)</span>

You might be interested in

Which of the following attributes of a website indicates a more reliable source for information?

scoundrel [369]

An attribute of a website that will indicate a more reliable source of information is when the site ends in ".edu". It is a top-level domain for education. It would mean that this particular site is linked to universities, colleges or other educational sites thus it gives more information that is real and factual.

3 0

2 years ago

Instead of sending an entire file in one big chunk across the Internet, __________ is used which dices the file up into little

azamat

Answer:

TCP/IP

Explanation:

TCP/IP which stands for Transmission Control Protocol and Internet Protocol are network protocols which divide your message into smaller chunks or fragments known as network packets and sends them out onto the Internet. When the chunks arrive at the intended destination, TCP/IP on the receiving end reassembles the network packets into the original message.

TCP/IP are the main protocols used for sending data over the internet.

7 0

2 years ago

What are the differences between a policy, a standard, and a practice? What are the three types of security policies? Where woul

hjlf

Answer:

The difference between a policy, a standard and a practice is as follow:

Policy: It can be defined as the written instructions that describe proper behavior.
Standard: It can be defined as the detailed statement of what must be done to comply with policy.
Practice: It can be defined as the examples of actions that would comply with policy.

The three types of security policies are:

Enterprise Information Sec. Policy (EISP) : High level policy that sets the strategic direction, scope, and tone for the organization's security efforts. Use: It is used to support the mission, vision and direction of the organization and sets the strategic direction, scope and tone for all security efforts

Issue Specific Sec. Policy (ISSP) : An organizational policy that provides detailed, targeted guidance to instruct all members of the organization in the use of a resource, such as one of its processes or technologies. Use: It is used to support routine operations and instructs employees on the proper use of these technologies and processes

System Specific Sec. Policy (SysSP): Organizational policies that often function as standards or procedures to be used wen configuring or maintaining systems. SysSPs can be separated into two general groups-managerial guidance and technical specifications- but may be written as a single unified document. Use: It is used as a standard when configuring or maintaining systems.
ISSP policy would be needed to guide the use of the web, email and use of personal use of office equipment.

3 0

2 years ago

Explain why each of the following names does or does not seem like a good variable name to represent a state sales tax rate.

tatyana61 [14]

a. stateTaxRate - A good variable name because it represents what it holds, the state sales tax rate, without being too wordy. Also correctly capitalized in camelcase.

b. txRt - A bad variable name because while short and simple, it is too hard to understand what the variable represents.

c. t - A very bad variable name if you plan on using the variable often. Far too short and you will forget what it represents and is needed for.

d. stateSalesTaxRateValue - A bad variable name because it is just too wordy. Cutting it down to A's variable name is much more reasonable

e. state tax rate - A bad variable name and probably invalid because it has spaces in the name.

f. taxRate - A good variable name if there are no other tax calculations other than state tax rate. Otherwise you would confuse state vs local tax rate or something, making it a bad variable name.

g. 1TaxRate - A bad variable name because the number 1 has no reason being in the variable name. It doesn't add anything to the name.

h. moneyCharged - A bad variable name because it is not specific enough in explaining why the money is being charged and what for.

7 0

2 years ago

Generating a signature with RSA alone on a long message would be too slow (presumably using cipher block chaining). Suppose we c

boyakko [2]

Answer:

Following are the algorithm to this question:

Explanation:

In the RSA algorithm can be defined as follows:

In this algorithm, we select two separate prime numbers that are the "P and Q", To protection purposes, both p and q combines are supposed to become dynamically chosen but must be similar in scale but 'unique in length' so render it easier to influence. Its value can be found by the main analysis effectively.

Computing N = PQ.

In this, N can be used for key pair, that is public and private together as the unit and the Length was its key length, normally is spoken bits. Measure,

$\lambda (N) = \ lcm( \lambda (P), \lambda (Q)) = \ lcm(P- 1, Q - 1)$ where $\lambda$ is the total function of Carmichaels. It is a privately held value. Selecting the integer E to be relatively prime from $1$ and $gcd(E, \lambda (N) ) = 1;$ that is $E \ \ and \ \ \lambda (N)$ . D was its complex number equivalent to E (modulo $\lambda (N)$ ); that is d was its design multiplicative equivalent of E-1.

It's more evident as a fix for d provided of DE ≡ 1 (modulo $\lambda (N)$ ).E with an automatic warning latitude or little mass of bigging contribute most frequently to 216 + 1 = 65,537 more qualified encrypted data.

In some situations it's was shown that far lower E values (such as 3) are less stable.

E is eligible as a supporter of the public key.

D is retained as the personal supporter of its key.

Its digital signature was its module N and the assistance for the community (or authentication). Its secret key includes that modulus N and coded (or decoding) sponsor D, that must be kept private. P, Q, and $\lambda (N)$ will also be confined as they can be used in measuring D. The Euler totient operates $\varphi (N) = (P-1)(Q - 1)$ however, could even, as mentioned throughout the initial RSA paper, have been used to compute the private exponent D rather than λ(N).

It applies because $\varphi (N)$ , which can always be split into $\lambda (N)$ , and thus any D satisfying DE ≡ 1, it can also satisfy (mod $\lambda (N)$ ). It works because $\varphi (N)$ , will always be divided by $\varphi (N)$ ,. That d issue, in this case, measurement provides a result which is larger than necessary (i.e. D > $\lambda (N)$ ) for time - to - time). Many RSA frameworks assume notation are generated either by methodology, however, some concepts like fips, 186-4, may demand that D< $\lambda (N)$ . if they use a private follower D, rather than by streamlined decoding method mostly based on a china rest theorem. Every sensitive "over-sized" exponential which does not cooperate may always be reduced to a shorter corresponding exponential by modulo $\lambda (N)$ .

As there are common threads (P− 1) and (Q – 1) which are present throughout the $N-1 = PQ-1 = (P -1)(Q - 1)+ (P-1) + (Q- 1))$ , it's also possible, if there are any, for all the common factors $(P -1) \ \ \ and \ \ (Q - 1)$ to become very small, if necessary.

Indication: Its original writers of RSA articles conduct their main age range by choosing E as a modular D-reverse (module $\varphi (N)$ ) multiplying. Because a low value (e.g. 65,537) is beneficial for E to improve the testing purpose, existing RSA implementation, such as PKCS#1, rather use E and compute D.

8 0

2 years ago