Dario48/pages
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

hw

Browse source
This commit is contained in:
Dario48true 2025-02-13 17:52:53 +01:00
parent b3c05b28fa
commit 763e36bf93
1 changed files with 108 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

108
site/home/Dario48/compito_online-ricerca_Dario-Spinnato-4Q-RSA-13022025.html Normal file
View file

@ -0,0 +1,108 @@
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN" "http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<!--This file was converted to xhtml by LibreOffice - see https://cgit.freedesktop.org/libreoffice/core/tree/filter/source/xslt for the code.-->
<head profile="http://dublincore.org/documents/dcmi-terms/">
<meta http-equiv="Content-Type" content="application/xhtml+xml; charset=utf-8"/>
<title xml:lang="en-US">- no title specified</title>
<meta name="DCTERMS.title" content="" xml:lang="en-US"/>
<meta name="DCTERMS.language" content="en-US" scheme="DCTERMS.RFC4646"/>
<meta name="DCTERMS.source" content="http://xml.openoffice.org/odf2xhtml"/>
<meta name="DCTERMS.issued" content="2025-02-13T17:40:44.366553222" scheme="DCTERMS.W3CDTF"/>
<meta name="DCTERMS.modified" content="2025-02-13T17:45:34.614244826" scheme="DCTERMS.W3CDTF"/>
<meta name="xsl:vendor" content="libxslt"/>
<link rel="schema.DC" href="http://purl.org/dc/elements/1.1/" hreflang="en"/>
<link rel="schema.DCTERMS" href="http://purl.org/dc/terms/" hreflang="en"/>
<link rel="schema.DCTYPE" href="http://purl.org/dc/dcmitype/" hreflang="en"/>
<link rel="schema.DCAM" href="http://purl.org/dc/dcam/" hreflang="en"/>
<style>
table { border-collapse:collapse; border-spacing:0; empty-cells:show }
td, th { vertical-align:top; font-size:12pt;}
h1, h2, h3, h4, h5, h6 { clear:both;}
ol, ul { margin:0; padding:0;}
li { list-style: none; margin:0; padding:0;}
span.footnodeNumber { padding-right:1em; }
span.annotation_style_by_filter { font-size:95%; font-family:Arial; background-color:#fff000; margin:0; border:0; padding:0; }
span.heading_numbering { margin-right: 0.8rem; }* { margin:0;}
.paragraph-P1{ font-size:28pt; font-weight:bold; margin-bottom:0.212cm; margin-top:0.423cm; text-align:center ! important; font-family:'Liberation Sans'; writing-mode:horizontal-tb; direction:ltr;line-height:115%; }
.paragraph-P2{ font-size:13pt; font-family:'Liberation Serif'; writing-mode:horizontal-tb; direction:ltr;}
.paragraph-P3{ font-size:13pt; font-family:'Liberation Serif'; writing-mode:horizontal-tb; direction:ltr;}
.paragraph-P4{ font-size:13pt; line-height:115%; margin-bottom:0.247cm; margin-top:0cm; font-family:'Liberation Serif'; writing-mode:horizontal-tb; direction:ltr;font-weight:normal; }
.text-T1{ font-weight:normal; }
.text-T2{ font-weight:normal; }
/* ODF styles with no properties representable as CSS:
{ } */
</style>
</head>
<body dir="ltr" style="max-width:21.001cm;margin-top:2cm; margin-bottom:2cm; margin-left:2cm; margin-right:2cm; ">
<p class="paragraph-P1">RSA</p>
<p class="paragraph-P2">si scelgono a caso due numeri primi p e q </p>
<p class="paragraph-P2">p. es.</p>
<p class="paragraph-P3">- p = 13</p>
<p class="paragraph-P2">- q = 7</p>
<p class="paragraph-P2"><span class="text-T1"/></p>
<br />
<p class="paragraph-P2"><span class="text-T1">si calcola il loro prodotto n = pq, chiamato modulo, e il prodotto φ(n) = (p – 1)(q – 1) (φ(x) è il numero degli interi coprimi a x)</span></p>
<p class="paragraph-P2"><span class="text-T1">p. es</span></p>
<p class="paragraph-P2"><span class="text-T1">- n = 91</span></p>
<p class="paragraph-P2"><span class="text-T1">- φ(n) = 72</span></p>
<p class="paragraph-P2"><span class="text-T1"/></p>
<br />
<p class="paragraph-P2"><span class="text-T1">si sceglie un numero coprimo a φ(n) </span><span class="text-T2">e</span><span class="text-T1"> più piccolo di esso</span></p>
<p class="paragraph-P2"><span class="text-T1">p. es</span></p>
<p class="paragraph-P2"><span class="text-T1">- e = 7</span></p>
<p class="paragraph-P2"><span class="text-T1"/></p>
<br />
<p class="paragraph-P2"><span class="text-T1">si calcola il numero d in modo che de % φ(n) = 1</span></p>
<p class="paragraph-P2"><span class="text-T1">p. es</span></p>
<p class="paragraph-P2"><span class="text-T1">- d = 31</span></p>
<p class="paragraph-P2"><span class="text-T1"/></p>
<br />
<p class="paragraph-P2"><span class="text-T1">la chiave pubblica è (n, e) e la chiave privata è (n, d) </span></p>
<p class="paragraph-P2"><span class="text-T1">p. es. </span></p>
<p class="paragraph-P2"><span class="text-T1">- pub = (91, 7)</span></p>
<p class="paragraph-P2"><span class="text-T1">- priv = (91, 31)</span></p>
<p class="paragraph-P2"><span class="text-T1"/></p>
<br />
<p class="paragraph-P2"><span class="text-T1">La forza dell'algoritmo sta nel fatto che per calcolare d da e (o viceversa) non basta la conoscenza di n ma serve il numero φ ( n ) = ( p − 1 ) ( q − 1 ) , e che il suo calcolo richiede tempi molto elevati; infatti fattorizzare in numeri primi (cioè scomporre un numero nei suoi divisori primi) è un'operazione computazionalmente costosa.</span></p>
<p class="paragraph-P4"> </p></body>
</html>