Cantitate/Preț
Produs

Tordes

Autor Ajay Bhushan
en Limba Engleză Paperback – 2 sep 2012
Tordes: A symmetric key algorithm - It is a block cipher algorithm and unique independent approach which uses several computational steps along with string of operators and randomized delimiter selections by using some suitable mathematical logic. It is specially designed to produce different cipher texts by applying same key on same plain text. It is one of the best performing partial symmetric key algorithms particularly for the text message with limited size. It also protects the cipher text from attacks like Brute-force like attack because it is fully dependent on the key and code cannot be deciphered by applying all possible combinations of keys. The following information invariably used in TORDES for encryption Techniques. Key Values Code sequence string generated from a particular process. Transformation of string. Mirror Image the string ADVANTAGES OF TORDES The algorithm is very simple in nature. There are more operations present in this algorithm which would make it more secured. For a small amount of data this algorithm will work very smoothly It can be implemented on any language i.e. C, C++, java, or any plate form like dot net or PHP.
Citește tot Restrânge

Preț: 27692 lei

Preț vechi: 34614 lei
-20% Nou

Puncte Express: 415

Preț estimativ în valută:
52100 5491$ 4423£

Carte tipărită la comandă

Livrare economică 22 martie-05 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783659218415
ISBN-10: 3659218413
Pagini: 84
Dimensiuni: 152 x 229 x 5 mm
Greutate: 0.14 kg
Editura: LAP LAMBERT ACADEMIC PUBLISHING AG & CO KG
Colecția LAP Lambert Academic Publishing

Notă biografică

Ajay Bhushan is M.Tech(I.T.)from Mahamaya Technical University Noida(U.P.)-INDIA.He is working as budding researcher in the field of Data Security and Cloud Computing.He has more than four year experience of software industry.He has also published & reviewed many research paper in National and International conferences & journals.