@prefix rdf:	<http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix dbpedia:	<http://dbpedia.org/resource/> .
@prefix ns2:	<http://dbpedia.org/class/yago/> .
dbpedia:Caesar_cipher	rdf:type	ns2:ClassicalCiphers .
@prefix dbpprop:	<http://dbpedia.org/property/> .
dbpedia:Caesar_cipher	dbpprop:name	"Caesar cipher"@en .
@prefix owl:	<http://www.w3.org/2002/07/owl#> .
dbpedia:Caesar_cipher	owl:sameAs	<http://rdf.freebase.com/ns/guid.9202a8c04000641f800000000005f7c5> .
@prefix foaf:	<http://xmlns.com/foaf/0.1/> .
@prefix ns6:	<http://en.wikipedia.org/wiki/> .
dbpedia:Caesar_cipher	foaf:page	ns6:Caesar_cipher ;
	dbpprop:reference	<http://www.murky.org/blg/category/cryptography/> ,
		<http://www.cs.utsa.edu/~wagner/laws/Acaesar.html> ,
		<http://www.murky.org/blg/2004/09/02/the-caesar-shift/> .
@prefix rdfs:	<http://www.w3.org/2000/01/rdf-schema#> .
dbpedia:Caesar_cipher	rdfs:label	"\u0428\u0438\u0444\u0440 \u0426\u0435\u0437\u0430\u0440\u044F"@uk ,
		"\u51F1\u6492\u5BC6\u78BC"@zh ,
		"Verschiebechiffre"@de ,
		"Xifratge de C\u00E8sar"@ca ,
		"C\u00E6sar-kryptering"@no ,
		"Caesarrullning"@sv ,
		"Cifrario di Cesare"@it ,
		"Caesar-rejtjel"@hu ,
		"\u0428\u0438\u0444\u0440 \u0426\u0435\u0437\u0430\u0440\u044F"@ru ,
		"Szyfr Cezara"@pl ,
		"Cifra de C\u00E9sar"@pt ,
		"\u30B7\u30FC\u30B6\u30FC\u6697\u53F7"@ja ,
		"Cifrado C\u00E9sar"@es ,
		"Caesarcijfer"@nl ,
		"Cifrul Cezar"@ro ,
		"Caesarova \u0161ifra"@cs ,
		"Chiffrement par d\u00E9calage"@fr ,
		"Caesar cipher"@en .
@prefix dbpedia-owl:	<http://dbpedia.org/ontology/> .
dbpedia:Caesar_cipher	dbpedia-owl:thumbnail	<http://upload.wikimedia.org/wikipedia/commons/thumb/2/2b/Caesar3.svg/200px-Caesar3.svg.png> ;
	dbpprop:abstract	"En cryptographie, le chiffrement par d\u00E9calage, aussi connu comme le chiffre de C\u00E9sar, est une m\u00E9thode de chiffrement tr\u00E8s simple utilis\u00E9e par Jules C\u00E9sar dans ses correspondances secr\u00E8tes (ce qui explique le nom \u00AB\u00A0chiffre de C\u00E9sar\u00A0\u00BB). Le texte chiffr\u00E9 s'obtient en rempla\u00E7ant chaque lettre du texte clair original par une lettre \u00E0 distance fixe, toujours du m\u00EAme c\u00F4t\u00E9, dans l'ordre de l'alphabet. Pour les derni\u00E8re lettres (dans le cas d'un d\u00E9calage \u00E0 droite), on reprend au d\u00E9but. Par exemple avec un d\u00E9calage de 3 vers la droite, A est remplac\u00E9 par D, B devient E, et ainsi jusqu'\u00E0 W qui devient Z, puis X devient A etc. Il s'agit d'une permutation circulaire de l'alphabet. La longueur du d\u00E9calage, 3 dans l'exemple \u00E9voqu\u00E9, constitue la cl\u00E9 du chiffrement qu'il suffit de transmettre au destinataire \u2013 s'il sait d\u00E9j\u00E0 qu'il s'agit d'un chiffrement de C\u00E9sar \u2013 pour que celui-ci puisse d\u00E9chiffrer le message. Dans le cas de l'alphabet latin, le chiffre de C\u00E9sar n'a que 26 cl\u00E9s possibles (la cl\u00E9 nulle, qui ne modifie pas le texte, comprise). Il s'agit d'un cas particulier de chiffrement par substitution monoaphab\u00E9tique : ces substitutions reposent sur un principe analogue, mais sont obtenues par des permutations quelconques des lettres de l'alphabet. Dans le cas g\u00E9n\u00E9ral, la cl\u00E9 est donn\u00E9e par la permutation, et le nombre de cl\u00E9s possibles est alors sans commune mesure avec celui des chiffrements de C\u00E9sar. Le chiffrement de C\u00E9sar a pu \u00EAtre utilis\u00E9 comme \u00E9l\u00E9ment d'une m\u00E9thode plus complexe, comme le chiffre de Vigen\u00E8re. Seul, il n'offre aucune s\u00E9curit\u00E9 de communication, \u00E0 cause du tr\u00E8s faible nombre de cl\u00E9s, ce qui permet d'essayer syst\u00E9matiquement celles-ci quand la m\u00E9thode de chiffrement est connue, mais aussi parce que, comme tout encodage par substitution monoalphab\u00E9tique, il peut \u00EAtre tr\u00E8s rapidement \u00AB cass\u00E9 \u00BB par analyse de fr\u00E9quences (certaines lettres apparaissent beaucoup plus souvent que les autres dans une langue naturelle)."@fr ,
		"Caesarova \u0161ifra je podkategori\u00ED rozs\u00E1hl\u00E9 kategorie tzv. substitu\u010Dn\u00EDch \u0161ifer."@cs ,
		"Il cifrario di Cesare \u00E8 uno dei pi\u00F9 antichi algoritmi crittografici di cui si abbia traccia storica. \u00C8 un cifrario a sostituzione monoalfabetica in cui ogni lettera del testo in chiaro \u00E8 sostituita nel testo cifrato dalla lettera che si trova un certo numero di posizioni dopo nell'alfabeto. Questi tipi di cifrari sono detti anche cifrari a sostituzione o cifrari a scorrimento a causa del loro modo di operare: la sostituzione avviene lettera per lettera, scorrendo il testo dall'inizio alla fine. In particolare, Cesare utilizzava uno spostamento di 3 posizioni (la chiave era dunque 3), secondo il seguente schema: Per cifrare un messaggio, basta prendere ogni lettera del testo in chiaro e sostituirla con la corrispondente lettera della riga testo cifrato. Per decifrare, viceversa. Ecco un semplice esempio: Cifrare (e decifrare) il testo pi\u00F9 volte non migliora la sicurezza, in quanto una rotazione di A posti seguita da una di B posti equivale ad una di A + B. Matematicamente parlando, la cifratura con le varie chiavi forma un gruppo."@it ,
		"Fi\u015Fier:Caesar3. svg Aplicarea cifrului lui Cezar asupra unui text oarecare const\u0103 \u00EEn \u00EEnlocuirea fiec\u0103rei litere din textul ini\u0163ial cu una care se afl\u0103 la o distan\u0163\u0103 fix\u0103 \u00EEn alfabet. Acest exemplu este cu o deplasare de trei pozi\u0163ii, astfel \u00EEnc\u00E2t B din textul ini\u0163ial devine E \u00EEn textul criptat. \u00CEn criptografie, cifrul lui Cezar, numit \u015Fi cifru cu deplasare, codul lui Cezar sau deplasarea lui Cezar, este una dintre cele mai simple \u015Fi mai cunoscute tehnici de criptare. Este un tip de cifru al substitu\u0163iei, \u00EEn care fiecare liter\u0103 din textul ini\u0163ial este \u00EEnlocuit\u0103 cu o liter\u0103 care se afl\u0103 \u00EEn alfabet la o distan\u0163\u0103 fix\u0103 fa\u0163\u0103 de cea \u00EEnlocuit\u0103. De exemplu, cu o deplasare de 5 pozi\u0163ii, A este \u00EEnlocuit cu D, \u0102 devine E \u015Fi a\u015Fa mai departe. Aceast\u0103 metod\u0103 este numit\u0103 a\u015Fa dup\u0103 Iulius Cezar, care o folosea pentru a comunica cu generalii s\u0103i. Pasul de criptare al cifrului lui Cezar este de obicei \u00EEncorporat \u00EEn scheme mai complexe precum Cifrul Vigen\u00E8re, \u015Fi \u00EEnc\u0103 mai are aplica\u0163ii moderne \u00EEn sistemul ROT13. Ca orice alt cifru bazat pe substitu\u0163ii alfabetice, cifrul lui Cezar este simplu de descifrat \u015Fi \u00EEn practic\u0103 nu ofer\u0103 securitate suficient\u0103."@ro ,
		"\u0428\u0438\u0444\u0440 \u0426\u0435\u0437\u0430\u0440\u044F \u2014 \u0441\u0438\u043C\u0435\u0442\u0440\u0438\u0447\u043D\u0438\u0439 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u0448\u0438\u0444\u0440\u0443\u0432\u0430\u043D\u043D\u044F \u043F\u0456\u0434\u0441\u0442\u0430\u043D\u043E\u0432\u043A\u0430\u043C\u0438. \u0412\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0432\u0430\u0432\u0441\u044F \u0440\u0438\u043C\u0441\u044C\u043A\u0438\u043C \u0456\u043C\u043F\u0435\u0440\u0430\u0442\u043E\u0440\u043E\u043C \u042E\u043B\u0456\u0454\u043C \u0426\u0435\u0437\u0430\u0440\u0435\u043C \u0434\u043B\u044F \u043F\u0440\u0438\u0432\u0430\u0442\u043D\u043E\u0433\u043E \u043B\u0438\u0441\u0442\u0443\u0432\u0430\u043D\u043D\u044F."@uk ,
		"En criptograf\u00EDa, un cifrado C\u00E9sar, tambi\u00E9n conocido como cifrado por desplazamiento, es una de las t\u00E9cnicas de codificaci\u00F3n m\u00E1s simples y m\u00E1s usadas. Es un tipo de cifrado por sustituci\u00F3n en el que una letra en el texto original es reemplazada por otra letra que se encuentra tres posiciones m\u00E1s adelante en el alfabeto. Por ejemplo, la A ser\u00EDa sustituida por la D (situada 3 lugares a la derecha de la A), la B ser\u00EDa reemplazada por la E, etc. Este m\u00E9todo debe su nombre a Julio C\u00E9sar, que lo usaba para comunicarse con sus generales. El cifrado C\u00E9sar muchas veces es parte componente de sistemas m\u00E1s complejos de codificaci\u00F3n, como el cifrado Vigen\u00E8re, e incluso tiene aplicaci\u00F3n en el sistema ROT13. Como todos los cifrados de sustituci\u00F3n alfab\u00E9tica simple, el cifrado C\u00E9sar se descifra con facilidad y en la pr\u00E1ctica no ofrece mucha seguridad a la comunicaci\u00F3n."@es ,
		"\u5728\u5BC6\u7801\u5B66\u4E2D\uFF0C\u607A\u6492\u5BC6\u7801\uFF08\u6216\u79F0\u607A\u6492\u52A0\u5BC6\u3001\u607A\u6492\u53D8\u6362\u3001\u53D8\u6362\u52A0\u5BC6\uFF09\u662F\u4E00\u79CD\u6700\u7B80\u5355\u4E14\u6700\u5E7F\u4E3A\u4EBA\u77E5\u7684\u52A0\u5BC6\u6280\u672F\u3002\u5B83\u662F\u4E00\u79CD\u66FF\u6362\u52A0\u5BC6\u7684\u6280\u672F\uFF0C\u660E\u6587\u4E2D\u7684\u6240\u6709\u5B57\u6BCD\u90FD\u5728\u5B57\u6BCD\u8868\u4E0A\u5411\u5F8C\uFF08\u6216\u5411\u524D\uFF09\u6309\u7167\u4E00\u4E2A\u56FA\u5B9A\u6570\u76EE\u8FDB\u884C\u504F\u79FB\u5F8C\u88AB\u66FF\u6362\u6210\u5BC6\u6587\u3002\u4F8B\u5982\uFF0C\u5F53\u504F\u79FB\u91CF\u662F3\u7684\u65F6\u5019\uFF0C\u6240\u6709\u7684\u5B57\u6BCDA\u5C06\u88AB\u66FF\u6362\u6210D\uFF0CB\u53D8\u6210E\uFF0C\u4EE5\u6B64\u7C7B\u63A8\u3002\u8FD9\u4E2A\u52A0\u5BC6\u65B9\u6CD5\u662F\u4EE5\u607A\u6492\u7684\u540D\u5B57\u547D\u540D\u7684\uFF0C\u5F53\u5E74\u607A\u6492\u66FE\u7528\u6B64\u65B9\u6CD5\u4E0E\u5176\u5C06\u519B\u4EEC\u8FDB\u884C\u8054\u7CFB\u3002 \u607A\u6492\u5BC6\u7801\u901A\u5E38\u88AB\u4F5C\u4E3A\u5176\u4ED6\u66F4\u590D\u6742\u7684\u52A0\u5BC6\u65B9\u6CD5\u4E2D\u7684\u4E00\u4E2A\u6B65\u9AA4\uFF0C\u4F8B\u5982\u7EF4\u5409\u5C3C\u5C14\u5BC6\u7801\u3002\u607A\u6492\u5BC6\u7801\u8FD8\u5728\u73B0\u4EE3\u7684ROT13\u7CFB\u7EDF\u4E2D\u88AB\u5E94\u7528\u3002\u4F46\u662F\u548C\u6240\u6709\u7684\u5229\u7528\u5B57\u6BCD\u8868\u8FDB\u884C\u66FF\u6362\u7684\u52A0\u5BC6\u6280\u672F\u4E00\u6837\uFF0C\u607A\u6492\u5BC6\u7801\u975E\u5E38\u5BB9\u6613\u88AB\u7834\u89E3\uFF0C\u800C\u4E14\u5728\u5B9E\u9645\u5E94\u7528\u4E2D\u4E5F\u65E0\u6CD5\u4FDD\u8BC1\u901A\u4FE1\u5B89\u5168\u3002"@zh ,
		"\u0425\u0435\u0445 \u2014 \u043E\u0434\u0438\u043D \u0438\u0437 \u0434\u0440\u0435\u0432\u043D\u0435\u0439\u0448\u0438\u0445 \u0448\u0438\u0444\u0440\u043E\u0432. \u041F\u0440\u0438 \u0448\u0438\u0444\u0440\u043E\u0432\u0430\u043D\u0438\u0438 \u043A\u0430\u0436\u0434\u044B\u0439 \u0441\u0438\u043C\u0432\u043E\u043B \u0437\u0430\u043C\u0435\u043D\u044F\u0435\u0442\u0441\u044F \u0434\u0440\u0443\u0433\u0438\u043C, \u043E\u0442\u0441\u0442\u043E\u044F\u0449\u0438\u043C \u043E\u0442 \u043D\u0435\u0433\u043E \u0432 \u0430\u043B\u0444\u0430\u0432\u0438\u0442\u0435 \u043D\u0430 \u0444\u0438\u043A\u0441\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u043E\u0435 \u0447\u0438\u0441\u043B\u043E \u043F\u043E\u0437\u0438\u0446\u0438\u0439. \u0428\u0438\u0444\u0440 \u0426\u0435\u0437\u0430\u0440\u044F \u043C\u043E\u0436\u043D\u043E \u043A\u043B\u0430\u0441\u0441\u0438\u0444\u0438\u0446\u0438\u0440\u043E\u0432\u0430\u0442\u044C \u043A\u0430\u043A \u0448\u0438\u0444\u0440 \u043F\u043E\u0434\u0441\u0442\u0430\u043D\u043E\u0432\u043A\u0438, \u043F\u0440\u0438 \u0431\u043E\u043B\u0435\u0435 \u0443\u0437\u043A\u043E\u0439 \u043A\u043B\u0430\u0441\u0441\u0438\u0444\u0438\u043A\u0430\u0446\u0438\u0438 \u2014 \u0448\u0438\u0444\u0440 \u043F\u0440\u043E\u0441\u0442\u043E\u0439 \u0437\u0430\u043C\u0435\u043D\u044B. \u0428\u0438\u0444\u0440 \u043D\u0430\u0437\u0432\u0430\u043D \u0432 \u0447\u0435\u0441\u0442\u044C \u0440\u0438\u043C\u0441\u043A\u043E\u0433\u043E \u0438\u043C\u043F\u0435\u0440\u0430\u0442\u043E\u0440\u0430 \u0413\u0430\u044F \u042E\u043B\u0438\u044F \u0426\u0435\u0437\u0430\u0440\u044F, \u0438\u0441\u043F\u043E\u043B\u044C\u0437\u043E\u0432\u0430\u0432\u0448\u0435\u0433\u043E \u0435\u0433\u043E \u0434\u043B\u044F \u0441\u0435\u043A\u0440\u0435\u0442\u043D\u043E\u0439 \u043F\u0435\u0440\u0435\u043F\u0438\u0441\u043A\u0438. \u0415\u0441\u0442\u0435\u0441\u0442\u0432\u0435\u043D\u043D\u044B\u043C \u0440\u0430\u0437\u0432\u0438\u0442\u0438\u0435\u043C \u0448\u0438\u0444\u0440\u0430 \u0426\u0435\u0437\u0430\u0440\u044F \u0441\u0442\u0430\u043B \u0448\u0438\u0444\u0440 \u0412\u0438\u0436\u0435\u043D\u0435\u0440\u0430. \u0421 \u0442\u043E\u0447\u043A\u0438 \u0437\u0440\u0435\u043D\u0438\u044F \u0441\u043E\u0432\u0440\u0435\u043C\u0435\u043D\u043D\u043E\u0433\u043E \u043A\u0440\u0438\u043F\u0442\u043E\u0430\u043D\u0430\u043B\u0438\u0437\u0430, \u0448\u0438\u0444\u0440 \u0426\u0435\u0437\u0430\u0440\u044F \u043D\u0435 \u0438\u043C\u0435\u0435\u0442 \u043F\u0440\u0438\u0435\u043C\u043B\u0435\u043C\u043E\u0439 \u0441\u0442\u043E\u0439\u043A\u043E\u0441\u0442\u0438. \u041A\u0441\u0442\u0430\u0442\u0438, \u0435\u0441\u043B\u0438 \u0432\u0432\u0435\u0441\u0442\u0438 \u0432 \u044F\u043D\u0434\u0435\u043A\u0441\u0435 \"\u0424\u044D\u0437\u044B\u044F \u0439\u0437 \u0437\u044C\u0438 \u0430\u0445\u043B\u0448 \u043F\u0432\u0451\u043D\u043B\u0448 \u0447\u0443\u0433\u0440\u0449\u0446\u043A\u0444\u043D\u043B\u0448 \u0434\u0446\u043E\u0441\u043D, \u0436\u0433 \u0435\u044E\u0442\u0437\u043C \u044A\u0433\u0431. \", \u0442\u043E \u043E\u043D \u0441\u0440\u0430\u0437\u0443 \u0432\u044B\u0432\u043E\u0434\u0438\u0442 \"\u0428\u0438\u0444\u0440 \u0446\u0435\u0437\u0430\u0440\u044F\". \u0418 \u043F\u043E\u043D\u044F\u0442\u043D\u043E, \u043F\u043E\u0447\u0435\u043C\u0443. \u0412\u0438\u0434\u0438\u043C\u043E \u043D\u0435 \u0442\u043E\u043B\u044C\u043A\u043E \u0432 \u0412\u0438\u043A\u0438\u043F\u0435\u0434\u0438\u0438 \u0434\u043E\u0433\u0430\u0434\u0430\u043B\u0438\u0441\u044C \u043D\u0430\u043F\u0438\u0441\u0430\u0442\u044C \u0441\u0442\u043E\u043B\u044C \u0437\u043D\u0430\u043A\u043E\u043C\u044B\u0439 \u043C\u043D\u043E\u0433\u0438\u043C \u0442\u0435\u043A\u0441\u0442!"@ru ,
		"In cryptography, a Caesar cipher, also known as a Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 3, A would be replaced by D, B would become E, and so on. The method is named after Julius Caesar, who used it to communicate with his generals. The encryption step performed by a Caesar cipher is often incorporated as part of more complex schemes, such as the Vigen\u00E8re cipher, and still has modern application in the ROT13 system. As with all single alphabet substitution ciphers, the Caesar cipher is easily broken and in practice offers essentially no communication security."@en ,
		"Het Caesarcijfer is een klassiek mono-alfabetisch substitutiecijfer. Het is bekend onder verscheidene namen waaronder Caesarrotatie, of kortweg Rot. Het is vernoemd naar Julius Caesar die het gebruikte om te communiceren met zijn veldheren. De versleuteling werkt door elke letter van de platte tekst te vervangen door een vooraf vastgestelde rotatie of verschuiving. Bij Rot3 (een rotatie van drie) wordt de letter A vervangen door de letter D (zie plaatje). Meer complexe schematieken, zoals het Vigen\u00E8recijfer, zijn deels gebaseerd op het principe. Vandaag de dag komt de rotatie voornamelijk voor in het Rot13 systeem. Als alle mono-alfabetische substituties biedt deze vorm van versleuteling geen enkele bescherming tegen cryptoanalyse."@nl ,
		"Szyfr Cezara (zwany te\u017C szyfrem przesuwaj\u0105cym lub kodem Cezara) \u2013 w kryptografii jedna z najprostszych i najbardziej znanych technik szyfrowania. Jest to rodzaj szyfru podstawieniowego, w kt\u00F3rym ka\u017Cda litera tekstu jawnego (niezaszyfrowanego) zast\u0119powana jest oddalon\u0105 od niej o sta\u0142\u0105 liczb\u0119 pozycji w alfabecie inn\u0105 liter\u0105, przy czym kierunek zamiany musi by\u0107 zachowany. Nie rozr\u00F3\u017Cnia si\u0119 przy tym liter du\u017Cych i ma\u0142ych. Nazwa szyfru pochodzi od Juliusza Cezara, kt\u00F3ry prawdopodobnie u\u017Cywa\u0142 tej techniki do komunikacji ze swymi przyjaci\u00F3\u0142mi. Algorytm szyfrowania zastosowany w kodzie Cezara bywa fragmentem bardziej z\u0142o\u017Conych system\u00F3w szyfrowania, takich jak szyfr Vigen\u00E8re'a. Wsp\u00F3\u0142cze\u015Bnie najcz\u0119\u015Bciej szyfru Cezara u\u017Cywa si\u0119 z przesuni\u0119ciem 13, b\u0119d\u0105cego prostym i szybkim sposobem na ukrycie tre\u015Bci. Obecnie \u0142amanie szyfru Cezara jest banalne, wi\u0119c jak ka\u017Cda technika podmieniaj\u0105ca pojedyncze litery alfabetu na inne, nie oferuje on \u017Cadnego bezpiecze\u0144stwa komunikacji."@pl ,
		"Em criptografia, a Cifra de C\u00E9sar, tamb\u00E9m conhecida como cifra de troca ou ainda c\u00F3digo de C\u00E9sar, \u00E9 uma das mais simples e conhecidas t\u00E9cnicas de criptografia. \u00C9 um tipo de cifra de substitui\u00E7\u00E3o em que cada letra do texto \u00E9 substitu\u00EDda por outra, que se apresenta no alfabeto abaixo dela um n\u00FAmero fixo de vezes. Por exemplo, com uma troca de 3 posi\u00E7\u00F5es, A seria substitu\u00EDdo por D, B viraria E e assim por diante. O nome do m\u00E9todo teve origem numa t\u00E9cnica semelhante usada por J\u00FAlio C\u00E9sar para se comunicar com os seus generais. O sistema de criptografia de uma cifra de C\u00E9sar serve frequentemente de base ou \u00E9 incorporado como parte de esquemas mais complexos, como a cifra de Vigen\u00E8re, e continua tendo aplica\u00E7\u00F5es modernas, como no sistema ROT13. Como todas as cifras de substitui\u00E7\u00E3o monoalfab\u00E9ticas, a cifra de C\u00E9sar \u00E9 facilmente decifrada e na pr\u00E1tica n\u00E3o oferece essencialmente nenhuma seguran\u00E7a na comunica\u00E7\u00E3o."@pt ,
		"F\u00E1jl:Caesar3. svg A Caesar-k\u00F3d minden egyes bet\u0171t egy megadott sz\u00E1mmal eltolja az \u00E1b\u00E9c\u00E9ben. A k\u00E9pen a k\u00F3dnak az angol \u00E1b\u00E9c\u00E9ben val\u00F3 haszn\u00E1lata l\u00E1that\u00F3. A Caesar-k\u00F3d vagy Caesar-rejtjel az egyik legegyszer\u0171bb \u00E9s legelterjedtebb titkos\u00EDr\u00E1si m\u00F3dszer. Ez egy helyettes\u00EDt\u0151 rejtjel, ami azt jelenti, hogy minden egyes bet\u0171t az \u00E1b\u00E9c\u00E9ben egy t\u0151le meghat\u00E1rozott t\u00E1vols\u00E1gra l\u00E9v\u0151 bet\u0171vel kell helyettes\u00EDteni. \u00CDgy p\u00E9ld\u00E1ul, ha mondjuk az eltol\u00F3d\u00E1s 3, az angol \u00E1b\u00E9c\u00E9ben az A-t a D-vel, a B-t az E-vel stb. kell helyettes\u00EDteni. A magyar \u00E1b\u00E9c\u00E9re vonatkoztatva ez az A bet\u0171 helyett C-t, az \u00C1 bet\u0171 helyett CS-t jelent. Az elnevez\u00E9s\u00E9t Julius Caesar ut\u00E1n kapta, aki ennek a seg\u00EDts\u00E9g\u00E9vel kommunik\u00E1lt t\u00E1bornokaival. A Caesar \u00E1ltal haszn\u00E1lt titkos\u00EDr\u00E1si elj\u00E1r\u00E1st t\u00F6bb bonyolultabb kriptogr\u00E1fiai m\u00F3dszerbe is be\u00E9p\u00EDtett\u00E9k, \u00EDgy a Vigen\u00E8re-rejtjelbe \u00E9s a ROT13 rendszerbe. Azonban, mint b\u00E1rmely m\u00E1s \u00E1b\u00E9c\u00E9-helyettes\u00EDt\u00E9si m\u00F3dszerr\u0151l, a Caesar-rejtjelr\u0151l is elmondhat\u00F3, hogy nagyon k\u00F6nny\u0171 felt\u00F6rni, \u00EDgy a kommunik\u00E1ci\u00F3hoz nem ny\u00FAjt igazi biztons\u00E1got."@hu ,
		"Die Verschiebechiffre (auch als Caesar-Verschl\u00FCsselung, Caesar-Verschiebung oder schlicht als \u201EEinfacher Caesar\u201C bezeichnet) ist ein besonders simpler Sonderfall einer einfachen monoalphabetischen Substitution. Zum Zwecke der Verschl\u00FCsselung wird dabei jeder Buchstabe des lateinischen Standardalphabets um eine bestimmte Anzahl von Positionen zyklisch verschoben (rotiert). Die Anzahl bestimmt den Schl\u00FCssel, der f\u00FCr die gesamte Verschl\u00FCsselung unver\u00E4ndert bleibt. Es ist eine der einfachsten und unsichersten Formen einer Geheimschrift."@de ,
		"Caesarrullning eller Caesarchiffer \u00E4r en form av chiffer som anv\u00E4ndes av Julius Caesar. Det inneb\u00E4r att varje bokstav rullas ett best\u00E4mt antal steg fram\u00E5t, eller bak\u00E5t i alfabetet. Exempel med fyrstegsrullning: LIQPMK XI\u00C4X = HEMLIG TEXT"@sv ,
		"\u30B7\u30FC\u30B6\u30FC\u6697\u53F7\uFF08\u30B7\u30FC\u30B6\u30FC\u3042\u3093\u3054\u3046\u3001 Caesar cipher \uFF09\u3068\u306F\u3001\u5358\u4E00\u63DB\u5B57\u5F0F\u6697\u53F7\u306E\u4E00\u7A2E\u3067\u3001\u5E73\u6587\u306E\u5404\u6587\u5B57\u3092\u8F9E\u66F8\u9806\u306B3\u6587\u5B57\u3060\u3051\u30B7\u30D5\u30C8\u3057\u3066\u6697\u53F7\u6587\u3092\u3064\u304F\u308B\u6697\u53F7\u3067\u3042\u308B\u3002\u30AB\u30A8\u30B5\u30EB\u6697\u53F7\u3068\u3082\u547C\u3070\u308C\u308B\u3002\u6587\u5B57\u306E\u30B7\u30D5\u30C8\u6570\u306F\u56FA\u5B9A\u3067\u3042\u308B\u304C\u30013\u306B\u9650\u308B\u5FC5\u8981\u306F\u306A\u304F\u3001\u30B7\u30D5\u30C8\u6570\u30923\u4EE5\u5916\u306B\u3057\u305F\u65B9\u5F0F\u3082\u30B7\u30FC\u30B6\u30FC\u6697\u53F7\uFF08\u3042\u308B\u3044\u306F\u30B7\u30D5\u30C8\u6697\u53F7\uFF09\u3068\u547C\u3076\u3053\u3068\u304C\u3042\u308B\u3002 \u30B7\u30FC\u30B6\u30FC\u6697\u53F7\u306F\u30F4\u30A3\u30B8\u30E5\u30CD\u30EB\u6697\u53F7\u306A\u3069\u306E\u90E8\u54C1\u3068\u3057\u3066\u4F7F\u7528\u3055\u308C\u308B\u3053\u3068\u304C\u3042\u308B\u4ED6\u3001\u73FE\u4EE3\u3067\u3082\u30B7\u30D5\u30C8\u6570\u309213\u306B\u3057\u305F\u65B9\u5F0F\u3068\u3057\u3066ROT13\u304C\u4F7F\u7528\u3055\u308C\u308B\u3053\u3068\u304C\u3042\u308B\u3002"@ja ,
		"C\u00E6sarkryptering eller c\u00E6sarkode, c\u00E6sarchiffer, er en form for chiffer som ble brukt av Julius C\u00E6sar. Den inneb\u00E6rer at hver bokstav rulles et bestemt antall steg fremover eller bakover i alfabetet. C\u00E6sarkryptering er en av de enkleste og mest kjente formene for kryptering. Eksempel med rulling p\u00E5 fire steg: LIQQIPMK = HEMMELIG"@no ,
		"En criptografia, un xifrat de C\u00E8sar, conegut tamb\u00E9 com a codificaci\u00F3 de C\u00E8sar, xifratge per decalatge, codi de C\u00E8sar o decalatge de C\u00E8sar, \u00E9s una de les t\u00E8cniques de xifratge m\u00E9s senzilles i m\u00E9s abastament conegudes. \u00C9s un tipus de xifratge per substituci\u00F3 en el qual cada lletra del text clar se substitueix per una altra lletra que estigui un determinat nombre fix de posicions despla\u00E7ada a l'alfabet. Per exemple, amb un decalatge de 3, la A se substituiria per la D, la B esdevindria E, i aix\u00ED. El m\u00E8tode deu el seu nom a en Juli C\u00E8sar, qui el feia servir per comunicar-se amb els seus generals. El pas de xifratge que fa l'algorisme de C\u00E8sar sovint forma part d'esquemes de codificaci\u00F3 m\u00E9s complexos, com ara el xifratge de Vigen\u00E8re, i encara avui t\u00E9 aplicaci\u00F3 en el sistema ROT13. Com tots els sistemes de xifratge per substituci\u00F3 amb clau no aleat\u00F2ria m\u00E9s curta que el text, el xifratge de C\u00E8sar es pot trencar f\u00E0cilment i en la pr\u00E0ctica no ofereix cap mena de seguretat essencial en les comunicacions."@ca ;
	rdfs:comment	"F\u00E1jl:Caesar3. svg A Caesar-k\u00F3d minden egyes bet\u0171t egy megadott sz\u00E1mmal eltolja az \u00E1b\u00E9c\u00E9ben. A k\u00E9pen a k\u00F3dnak az angol \u00E1b\u00E9c\u00E9ben val\u00F3 haszn\u00E1lata l\u00E1that\u00F3. A Caesar-k\u00F3d vagy Caesar-rejtjel az egyik legegyszer\u0171bb \u00E9s legelterjedtebb titkos\u00EDr\u00E1si m\u00F3dszer. Ez egy helyettes\u00EDt\u0151 rejtjel, ami azt jelenti, hogy minden egyes bet\u0171t az \u00E1b\u00E9c\u00E9ben egy t\u0151le meghat\u00E1rozott t\u00E1vols\u00E1gra l\u00E9v\u0151 bet\u0171vel kell helyettes\u00EDteni."@hu ,
		"C\u00E6sarkryptering eller c\u00E6sarkode, c\u00E6sarchiffer, er en form for chiffer som ble brukt av Julius C\u00E6sar. Den inneb\u00E6rer at hver bokstav rulles et bestemt antall steg fremover eller bakover i alfabetet. C\u00E6sarkryptering er en av de enkleste og mest kjente formene for kryptering. Eksempel med rulling p\u00E5 fire steg: LIQQIPMK = HEMMELIG"@no ,
		"Fi\u015Fier:Caesar3. svg Aplicarea cifrului lui Cezar asupra unui text oarecare const\u0103 \u00EEn \u00EEnlocuirea fiec\u0103rei litere din textul ini\u0163ial cu una care se afl\u0103 la o distan\u0163\u0103 fix\u0103 \u00EEn alfabet. Acest exemplu este cu o deplasare de trei pozi\u0163ii, astfel \u00EEnc\u00E2t B din textul ini\u0163ial devine E \u00EEn textul criptat. \u00CEn criptografie, cifrul lui Cezar, numit \u015Fi cifru cu deplasare, codul lui Cezar sau deplasarea lui Cezar, este una dintre cele mai simple \u015Fi mai cunoscute tehnici de criptare."@ro ,
		"Caesarrullning eller Caesarchiffer \u00E4r en form av chiffer som anv\u00E4ndes av Julius Caesar. Det inneb\u00E4r att varje bokstav rullas ett best\u00E4mt antal steg fram\u00E5t, eller bak\u00E5t i alfabetet. Exempel med fyrstegsrullning: LIQPMK XI\u00C4X = HEMLIG TEXT"@sv ,
		""@zh ,
		"En criptografia, un xifrat de C\u00E8sar, conegut tamb\u00E9 com a codificaci\u00F3 de C\u00E8sar, xifratge per decalatge, codi de C\u00E8sar o decalatge de C\u00E8sar, \u00E9s una de les t\u00E8cniques de xifratge m\u00E9s senzilles i m\u00E9s abastament conegudes. \u00C9s un tipus de xifratge per substituci\u00F3 en el qual cada lletra del text clar se substitueix per una altra lletra que estigui un determinat nombre fix de posicions despla\u00E7ada a l'alfabet."@ca ,
		"En cryptographie, le chiffrement par d\u00E9calage, aussi connu comme le chiffre de C\u00E9sar, est une m\u00E9thode de chiffrement tr\u00E8s simple utilis\u00E9e par Jules C\u00E9sar dans ses correspondances secr\u00E8tes (ce qui explique le nom \u00AB\u00A0chiffre de C\u00E9sar\u00A0\u00BB). Le texte chiffr\u00E9 s'obtient en rempla\u00E7ant chaque lettre du texte clair original par une lettre \u00E0 distance fixe, toujours du m\u00EAme c\u00F4t\u00E9, dans l'ordre de l'alphabet."@fr ,
		"Caesarova \u0161ifra je podkategori\u00ED rozs\u00E1hl\u00E9 kategorie tzv. substitu\u010Dn\u00EDch \u0161ifer."@cs ,
		"Die Verschiebechiffre (auch als Caesar-Verschl\u00FCsselung, Caesar-Verschiebung oder schlicht als \u201EEinfacher Caesar\u201C bezeichnet) ist ein besonders simpler Sonderfall einer einfachen monoalphabetischen Substitution. Zum Zwecke der Verschl\u00FCsselung wird dabei jeder Buchstabe des lateinischen Standardalphabets um eine bestimmte Anzahl von Positionen zyklisch verschoben (rotiert). Die Anzahl bestimmt den Schl\u00FCssel, der f\u00FCr die gesamte Verschl\u00FCsselung unver\u00E4ndert bleibt."@de ,
		"En criptograf\u00EDa, un cifrado C\u00E9sar, tambi\u00E9n conocido como cifrado por desplazamiento, es una de las t\u00E9cnicas de codificaci\u00F3n m\u00E1s simples y m\u00E1s usadas. Es un tipo de cifrado por sustituci\u00F3n en el que una letra en el texto original es reemplazada por otra letra que se encuentra tres posiciones m\u00E1s adelante en el alfabeto. Por ejemplo, la A ser\u00EDa sustituida por la D (situada 3 lugares a la derecha de la A), la B ser\u00EDa reemplazada por la E, etc."@es ,
		"Het Caesarcijfer is een klassiek mono-alfabetisch substitutiecijfer. Het is bekend onder verscheidene namen waaronder Caesarrotatie, of kortweg Rot. Het is vernoemd naar Julius Caesar die het gebruikte om te communiceren met zijn veldheren. De versleuteling werkt door elke letter van de platte tekst te vervangen door een vooraf vastgestelde rotatie of verschuiving. Bij Rot3 (een rotatie van drie) wordt de letter A vervangen door de letter D (zie plaatje)."@nl ,
		"Em criptografia, a Cifra de C\u00E9sar, tamb\u00E9m conhecida como cifra de troca ou ainda c\u00F3digo de C\u00E9sar, \u00E9 uma das mais simples e conhecidas t\u00E9cnicas de criptografia. \u00C9 um tipo de cifra de substitui\u00E7\u00E3o em que cada letra do texto \u00E9 substitu\u00EDda por outra, que se apresenta no alfabeto abaixo dela um n\u00FAmero fixo de vezes. Por exemplo, com uma troca de 3 posi\u00E7\u00F5es, A seria substitu\u00EDdo por D, B viraria E e assim por diante."@pt ,
		"Il cifrario di Cesare \u00E8 uno dei pi\u00F9 antichi algoritmi crittografici di cui si abbia traccia storica. \u00C8 un cifrario a sostituzione monoalfabetica in cui ogni lettera del testo in chiaro \u00E8 sostituita nel testo cifrato dalla lettera che si trova un certo numero di posizioni dopo nell'alfabeto."@it ,
		"Szyfr Cezara (zwany te\u017C szyfrem przesuwaj\u0105cym lub kodem Cezara) \u2013 w kryptografii jedna z najprostszych i najbardziej znanych technik szyfrowania. Jest to rodzaj szyfru podstawieniowego, w kt\u00F3rym ka\u017Cda litera tekstu jawnego (niezaszyfrowanego) zast\u0119powana jest oddalon\u0105 od niej o sta\u0142\u0105 liczb\u0119 pozycji w alfabecie inn\u0105 liter\u0105, przy czym kierunek zamiany musi by\u0107 zachowany. Nie rozr\u00F3\u017Cnia si\u0119 przy tym liter du\u017Cych i ma\u0142ych."@pl ,
		""@ja ,
		"In cryptography, a Caesar cipher, also known as a Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 3, A would be replaced by D, B would become E, and so on."@en ,
		"\u0425\u0435\u0445 \u2014 \u043E\u0434\u0438\u043D \u0438\u0437 \u0434\u0440\u0435\u0432\u043D\u0435\u0439\u0448\u0438\u0445 \u0448\u0438\u0444\u0440\u043E\u0432. \u041F\u0440\u0438 \u0448\u0438\u0444\u0440\u043E\u0432\u0430\u043D\u0438\u0438 \u043A\u0430\u0436\u0434\u044B\u0439 \u0441\u0438\u043C\u0432\u043E\u043B \u0437\u0430\u043C\u0435\u043D\u044F\u0435\u0442\u0441\u044F \u0434\u0440\u0443\u0433\u0438\u043C, \u043E\u0442\u0441\u0442\u043E\u044F\u0449\u0438\u043C \u043E\u0442 \u043D\u0435\u0433\u043E \u0432 \u0430\u043B\u0444\u0430\u0432\u0438\u0442\u0435 \u043D\u0430 \u0444\u0438\u043A\u0441\u0438\u0440\u043E\u0432\u0430\u043D\u043D\u043E\u0435 \u0447\u0438\u0441\u043B\u043E \u043F\u043E\u0437\u0438\u0446\u0438\u0439. \u0428\u0438\u0444\u0440 \u0426\u0435\u0437\u0430\u0440\u044F \u043C\u043E\u0436\u043D\u043E \u043A\u043B\u0430\u0441\u0441\u0438\u0444\u0438\u0446\u0438\u0440\u043E\u0432\u0430\u0442\u044C \u043A\u0430\u043A \u0448\u0438\u0444\u0440 \u043F\u043E\u0434\u0441\u0442\u0430\u043D\u043E\u0432\u043A\u0438, \u043F\u0440\u0438 \u0431\u043E\u043B\u0435\u0435 \u0443\u0437\u043A\u043E\u0439 \u043A\u043B\u0430\u0441\u0441\u0438\u0444\u0438\u043A\u0430\u0446\u0438\u0438 \u2014 \u0448\u0438\u0444\u0440 \u043F\u0440\u043E\u0441\u0442\u043E\u0439 \u0437\u0430\u043C\u0435\u043D\u044B."@ru ,
		"\u0428\u0438\u0444\u0440 \u0426\u0435\u0437\u0430\u0440\u044F \u2014 \u0441\u0438\u043C\u0435\u0442\u0440\u0438\u0447\u043D\u0438\u0439 \u0430\u043B\u0433\u043E\u0440\u0438\u0442\u043C \u0448\u0438\u0444\u0440\u0443\u0432\u0430\u043D\u043D\u044F \u043F\u0456\u0434\u0441\u0442\u0430\u043D\u043E\u0432\u043A\u0430\u043C\u0438. \u0412\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0432\u0430\u0432\u0441\u044F \u0440\u0438\u043C\u0441\u044C\u043A\u0438\u043C \u0456\u043C\u043F\u0435\u0440\u0430\u0442\u043E\u0440\u043E\u043C \u042E\u043B\u0456\u0454\u043C \u0426\u0435\u0437\u0430\u0440\u0435\u043C \u0434\u043B\u044F \u043F\u0440\u0438\u0432\u0430\u0442\u043D\u043E\u0433\u043E \u043B\u0438\u0441\u0442\u0443\u0432\u0430\u043D\u043D\u044F."@uk ;
	foaf:depiction	<http://upload.wikimedia.org/wikipedia/commons/2/2b/Caesar3.svg> .
@prefix skos:	<http://www.w3.org/2004/02/skos/core#> .
@prefix ns10:	<http://dbpedia.org/resource/Category:> .
dbpedia:Caesar_cipher	skos:subject	ns10:Group_theory ,
		ns10:Classical_ciphers ,
		ns10:Julius_Caesar .
@prefix ns11:	<http://dbpedia.org/resource/Template:> .
dbpedia:Caesar_cipher	dbpprop:wikiPageUsesTemplate	ns11:quote ,
		ns11:infobox_block_cipher ,
		ns11:spoken_wikipedia ;
	dbpprop:quoteProperty	"Attic Nights 17.9.1\u20135"@en ,
		dbpedia:Life_of_Julius_Caesar ,
		"Whenever he wrote in cipher, he wrote B for A, C for B, and the rest of the letters on the same principle, using AA for X."@en ,
		dbpedia:Suetonius ,
		dbpedia:Aulus_Gellius ,
		"If he had anything confidential to say, he wrote it in cipher, that is, by so changing the order of the letters of the alphabet, that not a word could be made out. If anyone wishes to decipher these, and get at their meaning, he must substitute the fourth letter of the alphabet, namely D, for A, and so with the others."@en ,
		"There is even a rather ingeniously written treatise by the grammarian Probus concerning the secret meaning of letters in the composition of Caesar's epistles."@en ,
		dbpedia:Life_of_Augustus ;
	dbpprop:structure	dbpedia:Substitution_cipher ;
	dbpprop:caption	"The action of a Caesar cipher is to replace each plaintext letter with one a fixed number of places down the alphabet. This example is with a shift of three, so that a B in the plaintext becomes E in the ciphertext."@en ;
	dbpprop:cryptanalysis	"Susceptible to frequency analysis and brute force attacks."@en ;
	dbpprop:spokenWikipediaProperty	"Caesar_cipher.ogg"@en .
@prefix xsd:	<http://www.w3.org/2001/XMLSchema#> .
dbpedia:Caesar_cipher	dbpprop:spokenWikipediaProperty	"2005-04-14"^^xsd:date .
@prefix ns13:	<http://www4.wiwiss.fu-berlin.de/flickrwrappr/photos/> .
dbpedia:Caesar_cipher	dbpprop:hasPhotoCollection	ns13:Caesar_cipher .
dbpedia:Caesar	dbpprop:disambiguates	dbpedia:Caesar_cipher .
dbpedia:Caesar_Cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesar_Code	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesar_code	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesar_cypher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caeser_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesar_encryption	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesarean_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesarian_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Ceasarian_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Ceaserian_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:ROT3	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Shift_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
<http://dbpedia.org/resource/Caesar%27s_code>	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesar-shift_substitution_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesar_Shift	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesar_shift	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Caesar_shift_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
<http://dbpedia.org/resource/Caesar%E2%80%99s_cipher>	dbpprop:redirect	dbpedia:Caesar_cipher ,
		dbpedia:Caesar_cipher ,
		dbpedia:Caesar_cipher .
dbpedia:Cesarian_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Ceserian_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
dbpedia:Rotation_cipher	dbpprop:redirect	dbpedia:Caesar_cipher .
@prefix yago:	<http://mpii.de/yago/resource/> .
yago:Caesar_cipher	owl:sameAs	dbpedia:Caesar_cipher .