{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-O6OF4ACV/c3547e84-2550-42b6-a6b9-0d28737a8bec/PDF","dcterms:extent":"455 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-O6OF4ACV/08712b37-3d80-4e72-a445-36e870a3f9b5/TEXT","dcterms:extent":"0 KB"}],"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:DOC-O6OF4ACV","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-OE00UKYR"},{"@xml:lang":"sl","#text":"Matrika"}],"dcterms:issued":"2025","dc:creator":"Papež, Luka","dc:format":[{"@xml:lang":"sl","#text":"11 str."},{"@xml:lang":"sl","#text":"letnik:12"},{"@xml:lang":"sl","#text":"številka:2"}],"dc:identifier":["ISSN:2385-8567","COBISSID_HOST:250906371","URN:URN:NBN:SI:doc-O6OF4ACV"],"dc:language":"sl","dc:publisher":{"@xml:lang":"sl","#text":"Založba Fakultete za matematiko in fiziko Univerze v Ljubljani"},"dc:subject":[{"@xml:lang":"sl","#text":"faktorizacija števil"},{"@xml:lang":"en","#text":"integer factorization"},{"@xml:lang":"sl","#text":"kvantni algoritem"},{"@xml:lang":"en","#text":"quantum algorithm"},{"@xml:lang":"en","#text":"RSA encryption"},{"@xml:lang":"en","#text":"Shor algorithm"},{"@xml:lang":"sl","#text":"Shorov algoritem"},{"@xml:lang":"sl","#text":"šifriranje RSA"}],"dc:title":{"@xml:lang":"sl","#text":"Shorov algoritem|"},"dc:description":[{"@xml:lang":"sl","#text":"Shor’s algorithm is a quantum algorithm for integer factorization. As a motivating example, this article presents RSA encryption, which is known to be breakable using the Shor’s algorithm. Then it introduces the necessary theoretical background, including the basics of quantum circuits, the Quantum Fourier Transform and phase estimation. These concepts are then combined into a complete explanation of Shor’s Algorithm, which is applied to factorize the number 15"},{"@xml:lang":"sl","#text":"Shorov algoritem je kvantni algoritem za faktorizacijo števil. Članek začne s šifriranjem RSA, ki ga je mogoče razbiti s Shorovim algoritmom, kar služi kot motivacija za nadaljno obravnavo. Sledi predstavitev teoretičnega ozadja algoritma, vključno z osnovami kvantnih vezij, kvantno Fourierovo transformacijo in oceno faze. Ti koncepti so nato združeni v celovit opis delovanja Shorovega algoritma, njegova uporaba pa je ponazorjena s faktorizacijo števila 15"}],"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:DOC-O6OF4ACV","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:DOC-O6OF4ACV"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:DOC-O6OF4ACV/c3547e84-2550-42b6-a6b9-0d28737a8bec/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by-sa/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza v Ljubljani, Fakulteta za matematiko in fiziko"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:DOC-O6OF4ACV/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:DOC-O6OF4ACV"}}}}