Tài liệu miễn phí An ninh - Bảo mật
Download Tài liệu học tập miễn phí An ninh - Bảo mật
Bài giảng An toàn và bảo mật thông tin: Chương 2 - ThS. Trần Phương Nhung
Chương 2 Các phương pháp mã hóa cổ điển thuộc bài giảng An toàn và bảo mật thông tin,trong chương học này các bạn sẽ được tìm hiểu về modulo số học, vành ZN, phần tử nghịch đảo trên vành ZN, các hệ mật mã cổ điển-hệ mã dịch vòng ( shift cipher), các hệ mật mã cổ điển-hệ mã hóa thay thế(Substitution Cipher), các hệ mật mã cổ điển-hệ mã Affine, thuật toán Euclide mở rộng, phương pháp Vigenere, phương pháp mã hóa Hill, các hệ mã dòng, mã hóa One-time Pad(OTP), lý thuyết thông tin, lý thuyết độ phức tạp.
8/30/2018 4:28:30 AM +00:00
Ebook Applied cryptanalysis
In this book, we strive to present applied cryptanalytic attacks in an acces- sible form. Here, we are focused on practical attacks that actually break real- world systems, not attacks that merely indicate some theoretical weakness in a cipher.
8/30/2018 4:28:28 AM +00:00
Ebook Data-Driven Block ciphers for fast telecommunication systems
Ebook Data-Driven Block ciphers for fast telecommunication systems. Among different directions of applied cryptography, the cipher design based on the data-driven operations (DDOs) is, by comparison, poorly represented in the published and available literature.
8/30/2018 4:28:28 AM +00:00
Tập bài giảng An toàn và bảo mật thông tin: Phần 2 - Nguyễn Văn Tảo
Tập bài giảng An toàn và bảo mật thông tin phần 2 gồm 3 chương: Chuẩn mã dữ liệu DES, Mật mã công khai, Các sơ đồ chữ kí số. Với nội dung 3 chương trên sẽ giúp nghiên cứu sâu hơn về lĩnh vực an toàn thông tin trên mạng cũng như cách thức thực hiện các thao tác giúp bảo mật thông tin.
8/30/2018 4:28:25 AM +00:00
Tập bài giảng An toàn và bảo mật thông tin: Phần 1 - Nguyễn Văn Tảo
Tập bài giảng An toàn và bảo mật thông tin phần 1 là tài liệu hữu ích phục vụ cho học tập, nghiên cứu về công nghệ thông tin. Trong phần 1 này tài liệu sẽ gồm 2 chương: Tổng quan về an toàn và bảo mật thông tin, Phương pháp mã hóa cổ điển.
8/30/2018 4:28:25 AM +00:00
A Scheme for obtaining a Warrant Message from the Digital Proxy Signatures
In this paper we propose a new type of digital proxy signature scheme in which the warrant message can be recovered from the proxy signature.
8/30/2018 4:28:24 AM +00:00
Classification of Signature-only Signature Models
We introduce a set of criterions for classifying signature-only signature models. By the criterions, we classify signature models into 5 basic types and 69 general classes.
8/30/2018 4:28:24 AM +00:00
Kiểm tra độ an toàn của các trang web
Tài liệu Kiểm tra độ an toàn của các trang web giúp người đọc biết được những cách thức và thủ thuật để sử dụng internet an toàn mà không gặp phải những trường hợp lừa đảo, bị đánh cắp mật khẩu, dính vi - rút,... Đây là tài liệu bổ ích cho tất cả những ai đang sử dụng máy tính.
8/30/2018 4:28:20 AM +00:00
Bài giảng Các công nghệ tấn công mạng
Bài giảng Các công nghệ tấn công mạng, trong bài giảng này cần tìm hiểu các nội dung sau: Tổng quan tấn công mạng, tấn công có chủ đích, những hiểm họa cơ bản, các biện pháp phòng chống.
8/30/2018 4:28:16 AM +00:00
Bài giảng Tổng quan an ninh mạng
Bài giảng Tổng quan an ninh mạng, cùng tham khảo bài giảng này để tìm hiểu nội dung về tình hình an ninh thông tin cũng như kiến thức cần thiết về an ninh mạng.
8/30/2018 4:28:16 AM +00:00
Bài giảng Các công nghệ bảo mật
Bài giảng Các công nghệ bảo mật, trong bài giảng này người học sẽ đi vào tìm hiểu nội dung về các công nghệ truyền thống, các công nghệ hiện nay và giải pháp.
8/30/2018 4:28:16 AM +00:00
Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic
We introduce new modulus scaling techniques for transforming a class of primes into special forms which enables efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of scaled modulus.
8/30/2018 4:28:14 AM +00:00
Attacking M&M Collective Signature Scheme
A collective signature scheme aims to solve the problem ofsigning a message by multiple signers. Recently, Moldovyan and Moldo-vyan proposed a scheme for collective signatures based on Schnorrsignatures. We show some security weaknesses of the scheme.
8/30/2018 4:28:14 AM +00:00
The NTRU Cryptosystem
The NTRU cryptosystem is a relatively new public key cryptographic algorithm that was first introduced in 1996. The main advantage of this algorithm is that it runs much faster than conventional public key algorithms such as RSA.
8/30/2018 4:28:14 AM +00:00
Efficient Elliptic Curve Processor Architectures for Field Programmable Logic
Abstract Elliptic curve cryptosystems offer security comparable to that of traditional asymmetric cryptosystems, such as those based on the RSA encryption and digital signature algorithms, with smaller keys and computationally more efficient algorithms.
8/30/2018 4:28:14 AM +00:00
Performance Analysis of Elliptic Curve Cryptography on Reconfigurable Hardware
The Elliptic Curve Cryptography (ECC) is evolving as an important cryptography, and shows a promise to be an alternative of RSA. Small size, high security and other features characterize ECC. Based on the theory of ECC, this paper analyzes its advantages over other cryptographies and focuses on its principle.
8/30/2018 4:28:14 AM +00:00
Public key cryptography applications algorithms and mathematical explanations
The paper discusses some public key algorithms such as DH, RSA, DSA, ECDH and ECDSA and also gives mathematical explanations on the working of these algorithms. The paper also gives a brief introduction to modular arithmetic, which is the core arithmetic of almost all public key algorithms.
8/30/2018 4:28:14 AM +00:00
Chapter1: Secure Communication in Modern Information Societies
We are presently witnessing mergers and takeovers of unprecedented speed and extent be-tween companies once thought to have national identities, or at least clearly identifiablelines of products or services.
8/30/2018 4:28:14 AM +00:00
Secure hash standard
This standard specifies a Secure Hash Algorithm (SHA-1) which can be used to generatea condensed representation of a message called a message digest.
8/30/2018 4:28:14 AM +00:00
Security of Blind Digital Signatures
A digital signature scheme allows one to “sign” documents in such a way that everyone can verify the validity of authentic signatures, but no one can forge signatures of new documents.
8/30/2018 4:28:14 AM +00:00
Implementation of the SHA-2 Hash Family Standard Using FPGAs
The continued growth of both wired and wireless communications has triggered the revolution for the generation of new cryptographic algorithms. SHA-2 hash family is a new standard in the widely used hash functions category.
8/30/2018 4:28:14 AM +00:00
The Elliptic Curve Digital Signature Algorithm (ECDSA)
The Digital Signature Algorithm (DSA) was specified in a U.S. Government Federal Information Processing Standard (FIPS) called the Digital Signature Standard (DSS [70]).
8/30/2018 4:28:14 AM +00:00
The Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer’s secret DSA key when a few bits of the random nonces k (used at eachsignature generation) are known for a number of DSA signatures at most linear inlog q (q denoting as usual the small prime of DSA), under a reasonable assumption on the hash function used in DSA.
8/30/2018 4:28:14 AM +00:00
Digital signature scheme based on a new hard problem
Information authentication in computer networks and information sys-tems is usually performed with digital signature schemes (DSSes) that are attributed to public key cryptosystems.
8/30/2018 4:28:14 AM +00:00
XTR Implementation on Reconfigurable Hardware
In this paper, we propose an efficient hardware implementation of this primitive that can be used for asymmetric digital signature, key exchange and asymmetric encryption. To our knowledge this is the first hardware implementation of XTR.
8/30/2018 4:28:14 AM +00:00
Applied Cryptanalysis: Breaking Ciphers in the Real World
The book is designed to be accessible to motivated IT professionals who want to learn more about the specific attacks covered. In particular, every effort has been made to keep the chapters independent, so if someone is interested in has function cryptanalysis or RSA timing attacks, they do not necessarily need to study all of the previous material in the text. This would be particularly valuable to working professionals who might want to use the book as a way to quickly gain some depth on one specific topic.
8/30/2018 4:28:13 AM +00:00
Handbook of Applied Cryptography (Discrete Mathematics and Its Applications)
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications.
8/30/2018 4:28:13 AM +00:00
Implementation of DES Algorithm Using FPGA Technology
The goal of this project is to continue the work of a student who worked on a pipelined VHDL implementation of the DES algorithm. Two architectures are studied for this project: one which is the fastest possible and another one which results in the less area than the first architecture on the FPGA. The meaning of speed for this project is the throughput (number of bits processed per second) and the meaning of area is number of CLB’s.
8/30/2018 4:28:13 AM +00:00
A Review of Modular Multiplication Methods and Respective Hardware Implementations
Generally speaking, public-key cryptographic systems consist of raising elements of some group such as GF(2n), Z/NZ or elliptic curves, to large powers and reducing the result modulo some given element.
8/30/2018 4:28:13 AM +00:00
A comparative study of ElGamal based digital signature algorithms
We implement the classical and modified ElGamal digital signature scheme to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Baby-Step-Giant algorithm which works in the domain of natural integers.
8/30/2018 4:28:13 AM +00:00