SearcharxivSearch

arXiv subjects

Sarbajit Manna

Publications and source records attributed to Sarbajit Manna.

3 recordsLinked to original sources

A generalized family of anisotropic compact object in general relativity

We present model for anisotropic compact star under the general theory of relativity of Einstein. In the study a 4-dimensional spacetime has been considered which is embedded into the 5-dimensional flat metric so that the spherically symmetric metric has class 1 when the condition $e^λ=\left(\,1+C\,e^ν \,{ν'}^2\,\right)$ is satisfied ($λ$ and $ν$ being the metric potentials along with a constant $C$). A set of solutions for the field equations are found depending on the index $n$ involved in the physical parameters. The interior solutions have been matched smoothly at the boundary of the spherical distribution to the exterior Schwarzschild solution which necessarily provides values of the unknown constants. We have chosen the values of $n$ as $n=2$ and $n$=10 to 20000 for which interesting and physically viable results can be found out. The numerical values of the parameters and arbitrary constants for different compact stars are assumed in the graphical plots and tables as follows: (i) LMC X-4 : $a=0.0075$, $b=0.000821$ for $n=2$ and $a=0.0075$, $nb=0.00164$ for $n\ge 10$, (ii) SMC X-1: $a=0.00681$, $b=0.00078$ for $n=2$, and $a=0.00681$, $nb=0.00159$ for $n \ge 10$. The investigations on the physical features of the model include several astrophysical issues, like (i) regularity behavior of stars at the centre, (ii) well behaved condition for velocity of sound, (iii) energy conditions, (iv) stabilty of the system via the following three techniques - adiabatic index, Herrera cracking concept and TOV equation, (v) total mass, effective mass and compactification factor and (vi) surface redshift. Specific numerical values of the compact star candidates LMC X-4 and SMC X-1 are calculated for central and surface densities as well as central pressure to compare the model value with actual observational data.

physics.gen-ph

Proposing A Symmetric Key Bit-Level Block Cipher

A novel bit level block cipher based symmetric key cryptographic technique using G.C.D is proposed in this research paper. Entire plain text file is read one character at a time and according to the binary representation of ASCII value of the characters, entire plain text file is divided into n number of 16 bit blocks. Then an agreed-upon symmetric key file is formed by dividing each 16 bit block into two 8 bit sub blocks and by using Greatest Common Divisor (G.C.D) operation among them. The key size is 40 times the number of 16 bit blocks present in the plain text file as each block produces a key of size 40 bits. The character corresponding to the G.C.D value for each block is stored in the cipher text file which is sent by the sender to the receiver along with the symmetric key file. From the symmetric key file and the cipher text file, the receiver by applying reverse procedure, gets back the original plain text file. This technique has several merits, some of them are formation of symmetric key file dynamically, achievement of 50% compression rate in the cipher text file, better security in terms of brute force attack and applicability of the technique for a large number of files of different size and type.

cs.CR

Proposing A Ciphering Protocol

This paper describes a novel bit level stream cipher based symmetric key cryptographic technique. At first, sender and receiver agree upon a symmetric key. Then the symmetric key is formed using Greatest Common Divisor (G.C.D) of sum of even or odd bit positional weightth even or odd number and a symmetric key value is derived from the symmetric by the sender. The symmetric key value is XORed with the ASCII value of the plain text character to get the cipher text character. This is repeated for the entire plain text file. The symmetric key and the entire cipher text file is sent by the sender to the receiver. From the symmetric key, the receiver calculates the symmetric key value. The symmetric key value is XORed with the cipher text character to get back the plain text character. When this process is repeated for every cipher text character, then entire plain text file is formed by the decryption process. This technique has several advantages like formation of symmetric key dynamically, more emphasis on symmetric key value rather than the symmetric key, security and equal applicability for encryption and decryption of a large number of files of almost any type or extension.

cs.CR