Refine your search
Collections
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Pashazadeh, Saeid
- An Approach in Improving Transposition Cipher System
Abstract Views :500 |
PDF Views:94
Authors
Affiliations
1 Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, IR
2 Faculty of Engineering, Islamic Azad University -Tabriz Branch,Tabriz, IR
1 Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, IR
2 Faculty of Engineering, Islamic Azad University -Tabriz Branch,Tabriz, IR
Source
Indian Journal of Science and Technology, Vol 2, No 8 (2009), Pagination: 9-15Abstract
Transposition ciphers are stronger than simple substitution ciphers. However, if the key is short and the message is long, then various cryptanalysis techniques can be applied to break such ciphers. By adding 8 bits (one byte) for each byte using a function and another mathematical function to position the bits in a binary tree and using its in-order tour, this cipher can be made protected. Using an in-order tour of binary tree can diffuse the eight bits (includes 7 bits produced by the function and 1 random bit) and eight bits of the plaintext. This can highly protect the cipher. However, if the key management processes are not secured the strongest ciphers can easily be broken.Keywords
Cryptography, Binary Tree, Cipher Protection, Transposition CipherFull Text
References
- Barker WG (1977) Cryptanalysis of the Hagelin Cryptograph. Aegean Park Press.
- Deavours CA (1980) The black chamber: a column; how the British broke enigma. Cryptologia. 4 (3), 129–132.
- Deavours CA and Kruh L(1985) Machine Cryptography and Modern Cryptanalysis. Norwood MA, Artech House.
- Diffie W and Hellman ME(1979) Privacy and authentication: an introduction to cryptography. Proc. IEEE. 67 (3) 397–427.
- Gaines HF (1956) Cryptanalysis. Am. Photographic Press, 1937.
- Hagelin BCW (1994) The story of the Hagelin cryptos. Cryptologia. 18 (3), 204–242.
- Hodges A (1983) Alan Turing: The Enigma of Intelligence. Simon & Schuster.
- Kahn D (1967) The Code breakers: The story of secret writing. New York, Macmillan Publ. Co.
- Kahn D (1991) Seizing the enigma. Boston: Houghton Mifflin Co.
- Konheim AG (1981) Cryptography. A Primer, New York, John Wiley & Sons.
- Mao Hewlett W-Packard (2003) Company modern cryptography: theory & practice. Prentice Hall PTR.
- Piper F and Murphy S (2002) Cryptography: a very short introduction. Oxford Univ. Press.
- Rivest RL (1981) Statistical analysis of the Hagelin cryptograph. Cryptologia, 5 (1), 27–32.
- Scherbius A (1928) Ciphering machine. U.S. Patent #1,657,411.
- Schinier B (1996) Applied cryptography. John Wiley & sons Inc. New York.
- Shannon CE (1949) Communication theory of secrecy systems. Bell System Tech. J. 28 (4), 656–715.
- Singh, Simon (2000) The code book: the science of secrecy from ancient Egypt to quantum cryptography. Anchor Book.
- Sinkov A (1966) Elementary cryptanalysis, Math. Asso. Am.
- Vaudenay S (2006) A Classical introduction to modern cryptography, Springer Sci.+Business Media, Inc.
- Welchman G (1982) The hut six story: breaking the enigma codes. New York, McGraw–Hill.
- FPGA implementation of improved version of the Vigenere cipher
Abstract Views :383 |
PDF Views:103
Authors
Affiliations
1 Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, IR
2 Faculty of Engineering, Islamic Azad University-Tabriz Branch, Tabriz, IR
3 Faculty of Mathematical Sciences, University of Tabriz, Tabriz, IR
1 Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, IR
2 Faculty of Engineering, Islamic Azad University-Tabriz Branch, Tabriz, IR
3 Faculty of Mathematical Sciences, University of Tabriz, Tabriz, IR
Source
Indian Journal of Science and Technology, Vol 3, No 4 (2010), Pagination: 459-462Abstract
The use of cryptography has become increasingly important in recent years. Currently there are several good methods for encryption like AES and DES. Both of these algorithms require several rounds to encrypt a relatively small block of data. Stream ciphers, like Vigenere and Caesar in particular, only require one round. The Vigenere and Caesar ciphers, however, can be easily broken. Improved version of the Vigenere algorithm is obtained by adding random bits of padding to each byte to diffuse the language characteristics and this make the cipher unbreakable. In this paper we will present an efficient method for hardware implementation of the improved Vigenere algorithm.Keywords
Cryptography, Vigenere Algorithm, FPGAFull Text
References
- Bishop M (2003) Computer security art and security. Person education Inc., NY.
- Dreyere C (2004) A pipelined implementation of AES for altera FPGA platforms,ECE575, Fall. 1-5.
- Helion Technology Ltd. (2009) High performance AES (rijndael) cores for altera FPGA, http://www.heliontech.com/aes.htm.
- Impaglizzo R and Levin L (1990) No better ways to generate hard NP instances than picking uniformly at random foundations of computer science. Proc. Of 31th IEEE Annual Symp. On Foundations of Computer Sci. 2, 812-821.
- Limpma H (2003) AES implementation speed comparison, http://www.tsc.hut.fi./~aes/rijndael.html.
- Nadehara K, Ikekawa M and Kuroda I (2004) Extended instructions for the AES cryptography and their efficient implementation. IEEE workshop on signal processing system (SIPS’04), Oct. 13-15, FA-1.3.
- NIST (2001) Advanced encryption standard (AES), Federal Inform. Proc. Standards Pub. 197 (FIPS197). http://www.altera.com
- Piper F and Murthy S (2002) Cryptography: a very short introduction. Oxford Univ. Press.
- Saggese G P, Mazzeo A and Strollo AGM (2003) An FPGA-based performance analysis of the unrolling, tiling, a pipelining of the AES algorithm. FPL 2003. LNCS 2778, 292-302.
- Sokouti M and Sokouti B (2009) Improved version of Vigenere algorithm, 12th conf. of ISCEE, 13-15.
- Sokouti M, Sokouti B and Pashazadeh S (2009) an approach in improving transposition cipher system. Indian J. Sci. Technol. 2(8), 9-15.
- Stallings W (2003) Cryptography and network security: Principles and practice, Prentice Hall, 3rd ed.
- Standert FX, Rouvory G, Quisqater JJ and Legat JD (2003) Efficient implementation of Rijndael encryption in reconfigurable hardware: Improvements and design tradeoffs. Proc. of CHES 2003. Lecture notes in computer Sci. 2523, 334-550.
- Stinson DR (2005) Cryptography theory and practice, 3rd ed. University of Waterloo, Ontario, Canada.
- Zambreno J, Nguyen D and Choudhary AN (2004) Exploring area/delay tradeoffs in an AES FPGA implementation, FPL 2004, LNCS3203, 575-585.
- Modeling Timestamp Ordering Method Using Colored Petri Net
Abstract Views :248 |
PDF Views:0
Authors
Affiliations
1 University of Tabriz, IR
1 University of Tabriz, IR
Source
Indian Journal of Science and Technology, Vol 8, No 35 (2015), Pagination:Abstract
Concurrency control methods are designed for preserving consistency of database systems when several concurrent transactions are running. Various concurrency control methods were developed that each one is appropriate for special applications and cases. One of the most common methods that guarantee serializability is timestamp ordering method (TO). This method is one of the timestamp-based methods. Conflicting read and write operations are executed such that scheduling of transactions be equivalent with serial schedule that transactions with lower time stamp precedes transactions with higher time stamp. TO is one of the widely used concurrency control mechanisms. This paper presents a hierarchical colored Petri net model of TO that can be used for formal verification of this algorithm. This model can be used as an important component in modeling and verification of database systems.
Keywords
Concurrency control; Database management system; Hierarchical colored Petri net; Modeling; Timestamp ordering; SerializabilityFull Text
- Modeling Automatic Generator of Optimal and Minimal Covers of Functional Dependency
Abstract Views :204 |
PDF Views:0
Authors
Affiliations
1 Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, IR
1 Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, IR
Source
Indian Journal of Science and Technology, Vol 8, No 35 (2015), Pagination:Abstract
Functional Dependency (FD) rules arise from applications semantic and enforcing integrity of minimal cover of FDs by normalization or triggers is sufficient condition for guaranteeing integrity of database. Formal achievement of minimal and optimal FDs from initial FDs is accomplished in this paper. Process of computing optimal and minimal FDs is presented and modeled by Colored Petri Net (CPN). Proposed model iteratively applies a subset of Armstrong’s axioms and infers FDs that are origin of all other FDs. Execution of model automatically is stopped when markings of model’s places do not change in iteration. Minimal and optimal FDs are automatically computed and stored in two different places of the model. Although CPN is used in many areas but modeling automatic generation of optimal and minimal cover set using CPN is a novel work. Proposed CPN model in this paper can be considered as automatic proof generator too. Model is designed such that state space graph of model is very small and is generated quickly. Colour sets are declared such that starting from initial markings, step by step proof of inferring optimal and minimal cover FDs can be extracted automatically. Proposed model can be used as a simple tool for automatically computing optimal and minimal FDs of a set of initial FDs.Keywords
Coloured Petri Net, Functional Dependency, Modeling, Optimal Cover, VerificationFull Text