"pre-shared key, PSK"@cs . "23"^^ . . . . "951551"^^ . . "p\u0159edsd\u00EDlen\u00E9 tajemstv\u00ED"@cs . . "15864190"^^ . . . . . . . . . "p\u0159edem sd\u00EDlen\u00FDm kl\u00ED\u010Dem"@cs . . . . . . . "P\u0159edsd\u00EDlen\u00FD kl\u00ED\u010D (PSK, t\u00E9\u017E p\u0159edsd\u00EDlen\u00E9 tajemstv\u00ED, anglicky Pre-shared key) je v kryptografii p\u0159edem sd\u00EDlen\u00FD tajn\u00FD kl\u00ED\u010D, kter\u00FD byl na obou stran\u00E1ch zaps\u00E1n pomoc\u00ED bezpe\u010Dn\u00E9ho kan\u00E1lu je\u0161t\u011B p\u0159ed t\u00EDm, ne\u017E ho bylo pot\u0159eba pou\u017E\u00EDt. Pro vytvo\u0159en\u00ED tajn\u00E9ho sd\u00EDlen\u00E9ho kl\u00ED\u010De slou\u017E\u00ED funkce pro odvozen\u00ED kl\u00ED\u010De. Takov\u00E9to syst\u00E9my t\u00E9m\u011B\u0159 v\u017Edy pou\u017E\u00EDvaj\u00ED kryptografick\u00FD algoritmus symetrick\u00E9ho kl\u00ED\u010De. Term\u00EDn PSK je pou\u017E\u00EDv\u00E1n nap\u0159\u00EDklad u Wi-Fi s\u00EDt\u00ED p\u0159i zabezpe\u010Den\u00ED pomoc\u00ED WEP nebo WPA. Zejm\u00E9na v EAP je t\u00E9\u017E zn\u00E1m\u00E9 EAP-PSK."@cs . . "P\u0159edsd\u00EDlen\u00FD kl\u00ED\u010D (PSK, t\u00E9\u017E p\u0159edsd\u00EDlen\u00E9 tajemstv\u00ED, anglicky Pre-shared key) je v kryptografii p\u0159edem sd\u00EDlen\u00FD tajn\u00FD kl\u00ED\u010D, kter\u00FD byl na obou stran\u00E1ch zaps\u00E1n pomoc\u00ED bezpe\u010Dn\u00E9ho kan\u00E1lu je\u0161t\u011B p\u0159ed t\u00EDm, ne\u017E ho bylo pot\u0159eba pou\u017E\u00EDt. Pro vytvo\u0159en\u00ED tajn\u00E9ho sd\u00EDlen\u00E9ho kl\u00ED\u010De slou\u017E\u00ED funkce pro odvozen\u00ED kl\u00ED\u010De. Takov\u00E9to syst\u00E9my t\u00E9m\u011B\u0159 v\u017Edy pou\u017E\u00EDvaj\u00ED kryptografick\u00FD algoritmus symetrick\u00E9ho kl\u00ED\u010De. Term\u00EDn PSK je pou\u017E\u00EDv\u00E1n nap\u0159\u00EDklad u Wi-Fi s\u00EDt\u00ED p\u0159i zabezpe\u010Den\u00ED pomoc\u00ED WEP nebo WPA. Zejm\u00E9na v EAP je t\u00E9\u017E zn\u00E1m\u00E9 EAP-PSK. Oba typy \u0161ifrov\u00E1n\u00ED kl\u00ED\u010De jsou vyu\u017E\u00EDv\u00E1ny u bezdr\u00E1tov\u00E9ho p\u0159\u00EDstupov\u00E9ho bodu (AP) a v\u0161ichni klienti sd\u00EDlej\u00ED stejn\u00FD kl\u00ED\u010D.Charakteristiky tohoto tajemstv\u00ED nebo kl\u00ED\u010De jsou d\u00E1ny podle pou\u017Eit\u00E9ho syst\u00E9mu. N\u011Bkter\u00E9 typy syst\u00E9m\u016F po\u017Eaduj\u00ED, aby byly tyto kl\u00ED\u010De v konkr\u00E9tn\u00EDm form\u00E1tu. T\u00EDm m\u016F\u017Ee b\u00FDt heslo, heslov\u00E1 fr\u00E1ze nebo hexadecim\u00E1ln\u00ED \u0159et\u011Bzec. Tajemstv\u00ED je pou\u017Eito u v\u0161ech syst\u00E9m\u016F, kter\u00E9 se zapojily do \u0161ifrovac\u00EDch proces\u016F pou\u017E\u00EDvan\u00FDch k zabezpe\u010Den\u00ED komunikace mezi syst\u00E9my.Stejn\u011B jako ve v\u0161ech p\u0159\u00EDpadech \u0161ifrovac\u00EDch syst\u00E9m\u016F spol\u00E9haj\u00EDc\u00EDch na jeden nebo v\u00EDce kl\u00ED\u010D\u016F pro d\u016Fv\u011Bryhodnost, pou\u017Eit\u00FD kl\u00ED\u010D nebo kl\u00ED\u010De mus\u00ED b\u00FDt dostate\u010Dn\u011B odoln\u00E9 proti \u00FAtoku. Jeden konkr\u00E9tn\u00ED \u00FAtok na kl\u00ED\u010De m\u016F\u017Eeme \u010Dekat, je j\u00EDm \u00FAtok hrubou silou. Dostate\u010Dn\u011B dlouh\u00FD, n\u00E1hodn\u011B vybran\u00FD kl\u00ED\u010D m\u016F\u017Ee b\u00FDt odoln\u00FD jak\u00E9mukoli praktick\u00E9mu \u00FAtoku hrubou silou. Ale nemus\u00ED, pokud m\u00E1 \u00FAto\u010Dn\u00EDk dostate\u010Dn\u00FD v\u00FDpo\u010Detn\u00ED v\u00FDkon (viz s\u00EDla hesla a prolomen\u00ED hesla). Nevyhnuteln\u011B v\u0161ak p\u0159edem sd\u00EDlen\u00E9 kl\u00ED\u010De v dr\u017Een\u00ED obou stran komunikace mohou ohrozit jednu ze stran, nev\u00EDme-li, kdo na druh\u00E9 stran\u011B je. Existuje n\u011Bkolik dostupn\u00FDch n\u00E1stroj\u016F, s jejich\u017E pomoc\u00ED si u\u017Eivatel zvol\u00ED siln\u00E9 heslo. Ka\u017Edop\u00E1dn\u011B v po\u010D\u00EDta\u010Dov\u00E9 s\u00EDti je spojen\u00ED v podstat\u011B nebezpe\u010Dn\u00E9, pokud nem\u016F\u017Eeme v\u011Bd\u011Bt, zda n\u011Bkdo neodposlouch\u00E1v\u00E1 na\u0161i komunikaci. Vyb\u00EDr\u00E1n\u00ED kl\u00ED\u010D\u016F pou\u017Eit\u00EDm kryptografick\u00FDch algoritm\u016F je specifick\u00E9 t\u00EDm, \u017Ee jak\u00E1koli pravidelnost m\u016F\u017Ee usnadnit \u00FAto\u010Dn\u00EDkovi \u00FAtok. To znamen\u00E1, \u017Ee n\u00E1hodn\u011B vybran\u00FD kl\u00ED\u010D p\u0159inut\u00ED \u00FAto\u010Dn\u00EDky vyvinout v\u011Bt\u0161\u00ED \u00FAsil\u00ED, co\u017E je velmi obt\u00ED\u017En\u00E9 i v praxi. Obecn\u00E9 pravidlo je rad\u011Bji nepou\u017E\u00EDvat jak\u00FDkoli software mimo kryptograficky bezpe\u010Dn\u00FD gener\u00E1tor pseudon\u00E1hodn\u00FDch \u010D\u00EDsel."@cs . . . . . . . "2504"^^ . "pre-shared key"@cs . . "Pre-shared key"@cs . . . "Pre-shared key"@cs .