Spelling suggestions: "subject:"ciphers."" "subject:"chiphers.""
1 |
Systematic cryptographic designHershey, J. E. (John E.) January 1968 (has links)
No description available.
|
2 |
Investigations of cellular automata-based stream ciphers /Testa, Joseph S. January 2008 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2008. / Typescript. Includes bibliographical references (leaves 119-137).
|
3 |
Polybius Square CiphersKong, Xiangbo January 2022 (has links)
In this thesis, we will define Polybius Square Ciphers and explain howit used to encrypt plaintext. We will talk about Playfair, ADFGX andADFGVX. We will introduce how Shannon entropy works and its principalproperties. We will use Shannon entropy and frequency comparison toshow whether Playfair and ADFG(V)X are uncertain and safe in today’stechnological environment.
|
4 |
The secrets behind cryptography : a mathematical overviewPovondra, Amy Becker 05 January 2011 (has links)
Daily advancements in technology influence many aspects of society. In today’s political and economic era, the need for secure, computerized convenience is apparent. Cryptosystems play a major role for everyone, from an individual making an online purchase to the government communicating with an ally during wartime. As technology advances, so do cryptosystems. The author of this paper discusses different types of cryptosystems, from substitution ciphers to public key cryptography, and introduces the mathematical foundations of such systems. / text
|
5 |
The capacity of multi-access TD/CCSK with decision feedback and transmitted referenceLin, Chang-Ho. January 1996 (has links)
Thesis (M.S.)--Ohio University, March, 1996. / Title from PDF t.p.
|
6 |
Computational algebraic attacks on the Advanced Encryption Standard (AES)Mantzouris, Panteleimon. January 2009 (has links) (PDF)
Thesis (M.S. in Electrical Engineering and M.S.in Applied Mathematics)--Naval Postgraduate School, September 2009. / Thesis Advisor(s): Canright, David ; Butler, Jon. "September 2009." Description based on title screen as viewed on 5 November 2009. Author(s) subject terms: Advanced Encryption Standard (AES), Rijndael's algorithm, block cipher, decipher, round of the algorithm, sparse multivariate polynomial. Includes bibliographical references (p. 101). Also available in print.
|
7 |
Correlation attacks on stream ciphers using convolutional codesBruwer, Christian S. January 2004 (has links)
Thesis (M.Eng.)(Electronic)--University of Pretoria, 2005. / Title from opening screen (viewed March 22, 2006). Includes summaries in English and Afrikaans. Includes bibliographical references.
|
8 |
A software cipher system for providing security for computer dataWalker, John Cleve January 2010 (has links)
Typescript, etc. / Digitized by Kansas Correctional Industries
|
9 |
Compact hardware implementation of advanced encryption standard with concurrent error detection /Yu, Namin, January 2005 (has links)
Thesis (M.Eng.)--Memorial University of Newfoundland, 2005. / Includes bibliographical references (leaves 105-112).
|
10 |
Maximum Codes with the Identifiable Parent PropertyJiang, Wen 20 November 2006 (has links)
We study codes that have identifiable parent property. Such codes are called IPP codes. Research on IPP codes is motivated by design of
schemes that protect against piracy of digital products.
Construction and decoding of maximum IPP codes have been studied in rich literature. General bounds on F(n,q), the maximum size of IPP
codes of length n over an alphabet with q elements, have been obtained through the use of techniques from graph theory and combinatorial
design. Improved bounds on F(3,q) and F(4,q) are obtained. Probabilistic techniques are also used to prove the existence of certain IPP codes.
We prove a precise formula for F(3,q), construct maximum IPP codes with size F(3,q), and give an efficient decoding algorithm for such codes. The main techniques used in this thesis are from graph theory and nonlinear optimization. Our approach may be used to improve bounds on F(2k+1, q). For
example, we characterize the associated graphs of
maximum IPP codes of length 5, and obtain bounds on F(5,q).
|
Page generated in 0.0403 seconds