Last major update: 25.08.2020
- Что такое авторизация/аутентификация
- Где хранить токены
- Как ставить куки ?
- Процесс логина
- Процесс рефреш токенов
- Кража токенов/Механизм контроля токенов
" Specify a directory for plugins | |
call plug#begin('~/.vim/plugged') | |
Plug 'neoclide/coc.nvim', {'branch': 'release'} | |
Plug 'scrooloose/nerdtree' | |
"Plug 'tsony-tsonev/nerdtree-git-plugin' | |
Plug 'Xuyuanp/nerdtree-git-plugin' | |
Plug 'tiagofumo/vim-nerdtree-syntax-highlight' | |
Plug 'ryanoasis/vim-devicons' | |
Plug 'airblade/vim-gitgutter' |
" plugins | |
let need_to_install_plugins = 0 | |
if empty(glob('~/.vim/autoload/plug.vim')) | |
silent !curl -fLo ~/.vim/autoload/plug.vim --create-dirs | |
\ https://raw.githubusercontent.com/junegunn/vim-plug/master/plug.vim | |
let need_to_install_plugins = 1 | |
endif | |
call plug#begin() | |
Plug 'tpope/vim-sensible' |
def check_pohlig_hellman(curve, generator=None): | |
""" | |
The Pohlig-Hellman algorithm allows for quick (EC)DLP solving if the order of the curve is smooth, | |
i.e its order is a product of multiple (small) primes. | |
The best general purpose algorithm for finding a discrete logarithm is the Baby-step giant-step | |
algorithm, with a running time of O(sqrt(n)). | |
If the order of the curve (over a finite field) is smooth, we can however solve the (EC)DLP | |
algorithm by solving the (EC)DLP for all the prime powers that make up the order, then using the |