Tech-Seeker

ST (ST) in the set-top box chip semiconductor integrated Cryptography Research Co., Ltd. R & D CryptoFirewall security kernel. This technology can prevent data tampering and anti-simulation dedicated hardware may be used in conjunction with set-top box conditional access system. CryptoFirewall is the demand for pay-TV industry, specially developed encryption firewall, has over 75 million devices to install, made flawless safety record. The product is suitable for satellite, cable and emerging IPTV pay-TV and pay-per-compatible TV and regular pay-TV business model.
  Pay-TV piracy is illegal to decrypt radio and television signals in order to achieve the purpose of viewing or dissemination of behavior. According to “The National Cable and Telecommunications Association (NCTA)” and “Asian countries, Cable and Satellite Broadcasting Association (CASBAA)” and other industry organizations in the survey, an annual pay-TV piracy loss of income caused by the global TV industry billions of dollars. These losses limit the development of the market, but also substantially increased the price of genuine users of the service. Crack are usually interfere with set-top box conditional access system, as conditional access system using smart card authentication is usually the user’s identity, so the card cloning and the use of a computer simulation of the smart card is a TV attack methods used by hackers to normal.
STi7108 launch to become the first release STMicroelectronics CryptoFirewall integrated set-top box SoC manufacturers. Apart from enhancing the security features, the integrated set-top box chip technology also enables equipment manufacturers and conditional access companies to shorten time to market, reduce development costs, to meet the broadcasters on the hardware security requirements.
We are high quality suppliers, our products such as 980nm diode laser module , 1470nm diode laser module for oversee buyer. To know more, please visits blue diode laser module.
Article Source

If you have been making use of portable document format then you would surely know that at the time of securing data in your files and while setting up password security, you are asked to adjust the encryption levels in the file. Given that you are an extensive computer user and a geek then you would surely have knowledge about what this means. This is ok if you are one but what if you are not and have no knowledge about the same? So what is encryption all about and how does it have an impact upon the security choices that you make? This has been discussed below.

The procedure of encoding data so as to allow access to be entrusted to just one person or computer with a key to decode it is what encryption all about. The information is turned into a complex piece or is scrambled with the help of algorithm and then it is untangled by the device with the help of key. This process is essential to carry out if you do not wish to see someone else misusing data that rightfully belongs to you. Take for instance, when sending confidential information relating your bank accounts and money available in your account, then you would not want that a third party should get its hands on that! Probably no person other than you should get access to the information or else it could intimidate the security. At the time of making encryption level choice, there are many representations elucidating various levels that are available. If the bit numbers are high then it means it is more secure and this will work with the most recent editions of Acrobat. PDF is a brainchild of Acrobat and it is used by people when they need to send files across platforms over the Net. PDF converter is used for file conversions from various other formats.

About keys: When a password is assigned to a document, a key is being set up for that specific document placed well in order. This is also known as symmetric key and for encryption as well as decryption the similar key is utilized. Another name for the same is ‘public key cryptography’ which combines private and public keys to access the information in a file. Private Key is just known to computer and public key is offered by one PC to another for successful data transfer or communication.

Jenny Hamper enjoys writing about Word to PDF Conversion. She works in software development since 2000s and knows very well about the importance of PDF to Word and pdf converter conversion tools in business industry.
Article Source

Nokia 3109 black is the much more secured handset announced by Nokia having plurality of security features. Huge options are made available for avoiding the unauthorized access to your phone and providing the handset safety from any kind of damages or scratches. Some encryption and decryption techniques have been acquired by the handset to solve the purpose. Anti virus are made available to download to keep your handset away from any kind of viruses.

Antivirus and security features  

Safe store gold edition, a beneficial utility for protecting your mobile phone, it allows the customers to store the passwords and providing the protective layer to the sensitive data stored in the handset. Safe store is basically a manager for managing the passwords; the users are facilitated to store any kind of personal and professional information in the handset like credit card, bank account, membership and personal details.

SMS 007 basics, if you don’t want anyone to read your messages then this option can play a significant role to solve the purpose. Some encryption techniques are being employed by the handset so that other might not read our personal messages. The cryptography methods used by the handset are Hash functions and AES cipher databases.Tresor, this option contains some powerful protective techniques for preventing the sensitive data of your handset from unauthorized or illegal access. For those handsets having strong Bluetooth technology, the extended version of Tresor has been introduced by Nokia named Tresor Blue.

SMS 007 upgrade, it is the powerful up gradation of the SMS 007 Basics and provides much security to your inbox comparatively. The messages are passed on the network in the encrypted approach and are stored in your inbox in the same formats. So if anyone tries to read your message, he/she might not be able to do that. You can learn the procedure from the manual provided with the handset, the one thing is considerable that for the security of the messages, this service should be available on both ends (receiving as well as sending).

Nokia 3600 Slide, Nokia 3610, Nokia 5220 are the popular offers and these mobile phone contracts are available on Online Mobile Phone Shop UK.

Article Source

<!– h1 { margin-top: 0.28cm; margin-bottom: 0.14cm; page-break-inside: avoid; }h1.western { font-family: “Liberation Serif”,serif; font-size: 12pt; font-weight: normal; }h1.cjk { font-family: “DejaVu Sans”; font-size: 12pt; font-weight: normal; }h1.ctl { font-family: “DejaVu Sans”; font-size: 12pt; font-weight: normal; }p { text-indent: 0.51cm; margin-bottom: 0.21cm; line-height: 95%; text-align: justify; } –> Introduction

 

In this age of information, communications and electronic connectivity, security is a topic of general interest that should never be underestimated. The security of databases, of data communications, of Internet connections, of scientific research and of personal e-mail and phone calls are examples for cases in which the encryption of data/information plays a major role. Therefore, cryptography has become an important field of theoretical research and applications development, not only in military communications as it was at its origins, but also for the business sector and private individuals.

Because of its importance, cryptography is nowadays a science by itself, strongly related to other modern research fields as complexity theory, chaos, dynamical systems, computing theory and so on. The state of the art for the field of cryptography is probably classified as it has military applications, but for the public domain a good reference can be found in [1], [2] and [3].

 

1.1 Cryptographic Techniques

Cryptographic techniques are divided into two categories: symmetric-key (or secret-key) and asymmetric- key (or public-key).They differ each other as follows: the symmetric algorithms use the same key for both encryption and decryption (or the decryption key is easily derived from the encryption key), whereas asymmetric algorithms use a different key for encryption and decryption, and the decryption key cannot be derived from the encryption key without knowing some additional secret information. Based on these algorithms there are two classes of symmetric-key encryption schemes: block ciphers and stream ciphers. Block ciphers breaks up the message into blocks of the fixed length and encrypt one block at a time. On the contrary, the stream ciphers encrypt a single bit of plain text at a time.

This paper deals with symmetric-key block encryption. CA have been used so far in both symmetric-key and public-key cryptography. Our goal is to develop an alternative cryptogram based on HAPCA, in which several CA technologies such as Wolfram approach [4], transform-based approach [5] and five evolution rules are combined in some way to form a cryptogram. A relevant relationship between the cellular automata and cryptography was revealed by Shanon in his fundamental early work [6].

In fact is a careless thing to use one or more nonlinear functions (in the case of cellular automat theory, the functions are represented by evolution rules) for projection of modern cipher, where these functions can be considerate as variant in continuous or discrete time of the cellular automation [7].

2. PROGRAMMABLE CELLULAR AUTOMATA

 

CA is a bio-inspired paradigm highly addressing the soft computing and hardware for a large class of applications including information security.From the days of Von Neumann and Stanislav Ulam who firstly proposed the concept of cellular automata (CA) –cellular spaces, to the recent book of Stephen Wolfram “A New Kind of Science” [4], the simple structure of CA has attracted researchers from different field of interests.

CA consists of a regular uniform n-dimensional lattice(or array). At each site of the lattice (cell), a physical cell quantity takes values. This physical quantity is the global state of the CA, and the value of this quantity at each is the local state of this cell. Each cell of the CA is restricted to local neighborhood interactions only, and as a result it is incapable of immediate global communication The neighborhood of the cell is taken to be the cell itself and some or all of the immediately adjacent cells. The cells evolve in discrete time steps according to some deterministic rule that depends only on local neighbours. In effect, each cell consists of a storage element (D flip-flop) and a combinational logic (CL) implemented the next-state functions (see Fig. 1). The combinational logic is called the “rule” of the CA.

 

 

 

 

 

 

Fig 1: CA cell

The next-state function describing a rule for a three neighborhood CA cell can be expressed as follows:

 

ai (t + 1) = f [ai (t ), ai +1 (t ), ai −1 (t )] (1)

 

Where i is the position of an individual cell in one-dimensional array of cells, t is the time step, and f is the rule of CA. If the rule of a CA involves only XOR logic, then it is called a linear rule. Rules involving XNOR logic are referred to as complement rules. A CA with all its cells having linear rules is called a linear CA, whereas a CA having a combination of XOR and XNOR rules is called additive CA. If all the cells obey the same rule, then the CA is said to be a uniform CA, otherwise, it is a hybrid CA. A CA is said to be a null boundary CA if both the left and right neighbor of the leftmost and rightmost terminal cell is connected to logic 0- state.

In practice, a control program, stored in memory, can be employed to activate the switches. For example, the state 1 or 0 of the bit i-th of a memory word either opens or closes the switch that controls that cell. Basically, such a structure is referred as a programmable CA (PCA). The very large phenomenology of the cellular automata model, its apparently big complexity and massive parallelism (however, this parallelism, when emulated in software or in sequential hardware, disappears) offer a good basis for applications in cryptography.

 

segments. As results, the operation of CA can be represented by a state-transition graph. Figure 2 shows the state transition graph of a null boundary condition CA.

 

Fig 2: The state transition graph

As the state space is discrete, on a finite lattice of any given size the number of possible configurations is necessarily finite. This means that, in principle at least, all possible configurations of the system can be enumerated and the step-by-step evolution can be represented by connecting those points with directed

 

Each node of the graph represents one of the possible states of the CA. The direct edges of the graph correspond to a single time step transition of the automata. Depending on the initial state, the CA can follow a certain trajectory inside the states space and can enter in different attractor basins. The PCA was firstly introduced in [8], where the CL of each cell is not fixed but controlled by a number of control signals such that different functions (i.e. rules) can be realized on the same structure. As a matter of fact, PCA are essentially a modified CA structure. It employs some control signals on a CA structure. By specifying certain values of control signals at run time, a PCA can implement various functions dynamically in terms of different rules.

 

3. PCA ENCRYPTION ALGORITHM

 

The encryption method proposed here is based on the fact that the CAs from class II exhibit periodic behavior (i.e. each state lays in some cycle). In these cases, their evolution depends essentially of the initial state, but we can say that after a while the initial state is “forgotten”, in sense that the initial state cannot be retrievable through analyses of the current configuration. The proposed encryption system it is implemented using a combination of three cellular automata: a CA-PRNG and two one-dimensional PCA. The block scheme of the

proposed encryption system is presented in Fig. 3 .

 

.

Fig 3: Block scheme of the encryption system

In the block cipher scheme, one 8-bit message block is enciphered by one enciphering function. The PCA control signals are activated with the help of the signals that are generated with the CA-PRNG or rules file. For the sake of simplicity, the enciphering function has two fundamental transformations FTs (PCA = 2) to operate on 8-bit data. For high security applications, more FTs are preferred. The block cipher (decipher) procedure can be defined as follows:

 

1. Load the PCA with one byte plaintext (cipher text) from I/O. The initial block of the message is the initial state of the PCA. The global configuration of the PCA represents the encrypted message.

 

2. Load a rule configuration control word from CA-PRNG into the PCA.

3. Run the PCA for 1 … 7

4. Repeat steps 2 and 3 for 2 times.

 

5. Send one byte ciphertext (plaintext) to I/O. If not end of the plaintext (ciphertext) go to step 1. Otherwise, stop the process.

 

3.1. EIGHT CELL PCA (PCA PIPELINE)

 

The block cipher algorithm presented in this paper is constructing using 2 PCA from class II, with rules 51, 60,102. Two 8-cell PCAs are cascaded to form a CA pipeline. With the pipeline, two CA FTs can be performed simultaneously. That means one enciphering function can be done in a single pipeline. The PCA presented here was obtained after a lot of simulations with different structural and behavioral parameters. The rules specify the evolution of the CA from neighborhoods configuration to the next state and these are presented in Table I.

 

Rules

7

111

6

110

5

110

4

100

3

011

2

010

1

001

0

000

51

0

0

1

1

0

0

1

1

60

0

0

1

1

1

1

0

0

102

0

1

1

0

0

1

1

0

 

27

26

25

24

23

22

21

20

 

TABLE I. Rules that update the next state of the cells of the ca-prng

 

The corresponding combinational logic of rules 51, 60,102 for PCA can be expressed as follows

 

ai (t + 1) = ai (t ) − ® 51 (2)

ai (t + 1) = ai (t ) ai −1 (t ) − ® 60 (3)

ai (t + 1) = ai (t ) ai +1 (t ) − ® 102 (4)

where i is the position of an individual cell in one-dimensional array of cells, t is the time step, N is the length of the CA. The PCA is a null boundary CA configured with the rules 51, 60 and 102 and its state-transition diagram consists of equal circles of even length. The null boundary 8-cell CA with rule configuration <51, 102, 102, 102, 51, 102, 51 and 102> generates cycles depicted in Fig. 4.

 

 

Fig4. The state transitions diagram of a non-maximum-length PCA

 

In the state-transition graph, the CA has two equal length cycles; each cycle has a cycle length 8. This phenomenon is a basic requirement of the enciphering scheme. For example, if we employ this CA as our enciphering function and define a plaintext as its original state, it goes to its intermediate state after four cycles. This is the process of enciphering. After running another four cycles, the intermediate state returns back to its original state, so the cipher text is deciphered into plaintext. This is the process of deciphering.

An 8-cell CA configured with rules 51, 60 (or 102) has 512 kinds of configurations, but only 156 of them have cycle length 8. The others have cycles of 2, 4, 16 or combination of them. In this encryption algorithm we use only the configurations of the rules that generate cycles of length 8.So the system designer is free to take any number in the 156 combinations to enhance the security of the system. Because of the fact that the PCA does not generate sequences of maximum-length for all the possible combinations (512) of the rules we must apply from the file or CA-PRNG only the combinations (156) that generate cycles of length 8. The rules with 8-cycle length can be seen in Table II.

0e

6e

8e

0e

0

13e

173

19c

1c7

0f0

1c

70

9c

0e1

0f1

117

13f

174

19d

1ce

1d

71

9d

0e2

0f2

11c

147

19e

1cf

175

1e

72

9e

0e3

0f3

11d

14e

176

19f

1d7

2e

73

0ae

0e4

0f4

11e

14f

177

1a7

1dc

 

 

TABLE II. RULES WITH 8 CYCLES LENGTH IN HEXADECIMAL

 

It consists of a D flip-flop and a logic combinational circuit (LCC). The LCC includes multiplexers and XNOR logic gates to implement the rules of CA and to control the loading of data and operation of the CA. When the load control signal (LoadData) is “logic 1″, data is loaded into D flip-flop. When LoadData is “logic 0″, data is run into the cell according to the rules applied to the rule control signals (S1, S0) and the states of neighbourhoods. After an established number of cycles (1 to 7), the data on the Q output of the flip-flop is sent out and new data is loaded in.

 

In this paper we decided to connect together sixteen cells in order to build two 8-cells PCA. In the 8-cell PCA, the data path is 8 bits (Data_In[0:7]), there are 9 rules configuration signals and one load data control signal (LoadData). Because all the cells share the same common rule signal S1, only rule 51 or one of the rules 60 or 102 can be applied at a given time. The left and right input terminals of every cell are connected to left and right neighbours DataOut terminals, thus it is configured as a 3-neighbourhood CA. The left and right terminals of the leftmost and rightmost cells are connected to “logic 0″providing a null boundary condition.

 

3.2. RULES GENERATOR (CA-PRNG OR RULES FILE)

 

The rule generator is designed to provide encryption rules for the encryption system. The rule generator consists of a modulus 156 counter and a file with 156 lines with rules or a CA used as a key stream generator. We can also use a CA as a key stream generator, CA pseudo-random number generator (PRNG) that combines in some way two rules (the rules 90 and 150), to provide the key sequence [9]. It has established that the maximum-length CAs generates patterns having a high quality of pseudo-randomness.

The corresponding combinational logic of rules 90, 150 for CA can be expressed as follows:

 

ai (t + 1) = ai −1 (t ) ai +1 (t ) − ® 90 (5)

ai (t + 1) = ai −1 (t ) ai (t ) ai +1 (t ) − ® 150 (6)

 

The evolution rules (keys of the block cipher) for the two PCA are selected from a file rules or from this CA. The operation of CA can be represented by a state-transition graph. Each node of the transition graph represents one of the possible states of the CA. The direct edges of the graph correspond to a single time step transition of the automata.The outputs of the CA-PRNG are connected to the selection signals (S1, S0) of the two PCA. If the rules are read from the file, first are loaded into a list structure. When the encryption process begins, rules are read out in sequence and sent to the PCA arrays.

 

4. CONCLUSIONS

 

The paper presents the methodology for the development of particular crypto schemes with PCA. This implies a huge simulation effort in order to choose a number of local rules combined with appropriate initial states and topology, which can be effectively applied in cryptography. The originally encryption technique presented in this paper demonstrates the power of the new block cipher cryptosystem based on programmable cellular automata. The cryptogram was tested and verified using an illustrative example in area of Yahoo messenger conversations and a primary encouraging result was the perfect concordance between encryption and decryption presented in software simulation. In the PCA encryption algorithm, the same cipher-text may be generated fromdifferent plain-text, and any cipher-text may give rise as well to different plain-text depending on the different PCA’s rule configuration.

M.Meenakshi Devi doing M.Phil in Computer Science at Alagappa University, Karaikudi, Tamilnadu, India
Article Source

Security is always been the major concern for most of the people and there were numerous researches on improving the security. Cryptography has been a major area of research for most of the scientists. Network security is an indispensable part. Customers need to trust the network in order to use it. Thus the users of the network must be well guarded with privacy and security. Confidentiality and integrity must be maintained in order to make people use a network. Cisco security certificates mechanism and its aspects certificates deals with security aspects of a network. In order to authenticate network devices digital certificates are greatly used and they play a major role in authenticating users in a network and one can use it between the network nodes to negotiate IPSec sessions. There are three different ways in which a Cisco device recognizes itself in the network.

The first one is the preshared keys, where two or more devices have same shared secret key and this is used by the peers for authentication. They compute a data and send it in order to authenticate themselves.

The receiver is expected to create the same hash and this does not depend on the preshared key. It is based on the concept of using the same secret in order to build trust. This method looks very similar to olden ways of communication and it is not very scalable.

The other popular method include self-signed certificate where a device is used for this purpose. It generates own certificate and takes ownership of it and signs it to be valid. One has to use this certificate in a limited manner. A very good example which illustrates the usage of this certificate is SSH. One can also find HTTPS access to be a good example and what it requires is all a username and a password. This is the primary requirement in order to establish a connection. One must be aware of the reloading of the persistent self-signed certificates which has the ability to survive reloads. It has the ability to be store in non-volatile RAM. This factor makes it to be persistent. SSl VPN is an excellent example for persistent SSI which has got a nonvolatile RAM. Another popular certificate is the certificate authority in which a third party is used for the validation process. He is used to authenticate the parties that are trying to communicate. Each party is given with a public and a private key.

The public key is employed for the encryption process and the private key is used with the decryption process. Since they are using the certificates, which were generated from the same source they are given assurance of the identities. In order to obtain the digital certificate one can use the ASA device. This is used to obtain the certificate from the third party.

One has to undergo an enrollment process and this can either be a manual or an automatic enrollment process. This method and the digital certificate is based on third party product and the certificate service is vendor based. One has to contact the vendor to obtain more information on this. One or more pre-shared keys are used with Cisco Adaptive security or third parties are involved in providing digital certificates which are used in the authentication of IPSec. Self-signed digital certificates can also be produced which are used with SSH, HTTPS.

The Cisco Adaptive Security Device Manager also uses this for its connections to the device. One can refer the document in order to understand the procedures for obtaining a digital certificate. This document does not include the procedure for the method of enrollment. One can find the use of ASDM and also the final command-line interface in the document.

One can refer various examples in order to get better enlightenment about the things in the Cisco IOS platform. A popular example includes the IOS certificate enrollment. One can also refer to related examples in order to understand about VPN 3000 series.

One must make sure the following rules are satisfied before proceeding to configuration.

Configure your window server.

Then make sure your server support Cisco axa pix version 7. 0

If required install extra dll files, in order to run the Cisco axa in window server.

Try to get the add-on dll as exe extension. These help you to add your Cisco application easily with the window server.

Make sure the date and time zone is configured properly in the window server.

Modules involved

Cisco asa with recent version should be used.

Cisco adaptive manager version should be minimum 5. 0

Window server should contain its certificate to ensure ability to run the program properly.

Added modules – This configuration also used in Cisco pix series also.

Step by step procedure to configure Asdm.

Click on Asdm application panel to choose configuration button.

Try to choose device manager from driver menu.

Enter the domain and the host name properly.

Then after configuration, click the save button.

Configure asa with proper time and date, and make sure the time setting is correct and matches with their time zones. To do the above configuration login in to ntp server.

Click the application panel, choose clock under device administration.

You can now able to see the calendar, choose the correct date and time in the calendar. Click the save button and close the window.

Now let us see how to configure the asa.

In the application panel, choose key pair under the certificate option.

Click add button, you get a pop up that asks you to fill the key name and size of key name.

Click generate key now and close the window.

Let us see the steps to add the network under trust worthy option in server.

Click on application panel and click add.

Here click the edit trustworthy configuration.

Fill the available key pair and give the related Microsoft URL address for the key used in server.

Let us see the steps to configure control retrieval methods.

Make sure you uncheck the directory access protocol.

Enable the simple http protocol by just putting check mark in check box.

Click save button and close it.

Ali Bitazar Is Computer Network Security Engineer.
Article Source