نتایج جستجو برای: cryptology

تعداد نتایج: 644  

2012
Zhaopin Su Guofu Zhang Jianguo Jiang

In the recent years, with the development of network and multimedia technology, multimedia data, especially image, audio and video data, is used more and more widely in human society. Some multimedia data, including entertainment, politics, economics, militaries, industries, education etc, are necessary to be protected by providing confidentiality, integrity, and ownership or identity. In this ...

1984
Marc Davio Yvo Desmedt Jean-Jacques Quisquater

New general properties in the S-boxes were found. Techniques and theorems are presented which allow to evaluate the non-substitution effect in f and the key clustering in DES. Examples are given. Its importance related to the security of DES is discussed. T. Beth, N. Cot, and I. Ingemarsson (Eds.): Advances in Cryptology EUROCRYPT '84, LNCS 209, pp. 62-73, 1985. 0 Spnnger-Verlag Berlin Heidelbe...

2007
Thomas Baignères

These lecture notes are a compilation of some of my readings while I was preparing two lectures given at EPFL on provable security in cryptography. They are essentially based on a book chapter from David Pointcheval called “Provable Security for Public Key Schemes” [24], on Victor Shoup’s tutorial on game playing techniques [30], on Coron’s Crypto’00 paper on the exact security of the Full Doma...

2014
Piyush Gupta Sandeep Kumar

This paper is based on the performance analysis of message digest 5 and secure hashing algorithm. These two topics are related with cryptography and cryptography is an extension of cryptology and cryptanalysis. The purpose of this paper is that to compare the time taken to build a hash as well as it also compares the bit rate passes through a hash value. Here we are going to perform a deep anal...

2005
Jörg Rothe

In this age of modern era, the use of internet must be maximized. Yeah, internet will help us very much not only for important thing but also for daily activities. Many people now, from any level can use internet. The sources of internet connection can also be enjoyed in many places. As one of the benefits is to get the on-line complexity theory and cryptology an introduction to cryptocomplexit...

Journal: :Global Journal of Science Frontier Research 2021

This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a structure, for monoid domains come here and there. The second part relationship between theory composites, Galois nilpotents. third this shows us some crypto systems. We find generalizations known ciphers taking into account infinite alphabet using simple methods....

1991
Alan T. Sherman

A superpolylogarithmic subexponential function is any function that asymptotically grows faster than any polynomial of any logarithm but slower than any exponential. We present a recently discovered nineteenth-century manuscript about these functions, which in part because of their applications in cryptology, have received considerable attention in contemporary computer science research. Attrib...

2011
Yu-Fang Chung Tzer-Long Chen Chih-Sheng Chen Tzer-Shyong Chen

This paper, pertaining to the design of a new security model with multiparty computation for security, aims to study the rational model and UC (universal composability) model as well as design a security protocol for the requirements of the models. The structures of secret sharing agreement, fair computation agreement, bit analysis agreement and the applications of these agreements on security ...

2010
İlker DALKIRAN Kenan DANIŞMAN

Chaotic systems are sensitive to initial conditions, system parameters and topological transitivity and these properties are also remarkable for cryptanalysts. Noise like behavior of chaotic systems is the main reason of using these systems in cryptology. However some properties of chaotic systems such as synchronization, fewness of parameters etc. cause serious problems for cryptology. In this...

2012
Samta Gajbhiye Sanjeev Karmakar Monisha Sharma

Public key cryptography systems are based on sound mathematical foundations that are designed to make the problem hard for an intruder to break into the system. Number theory and algebraic geometry, namely the theory of elliptic curves defined over finite fields, has found applications in cryptology. The basic reason for this is that elliptic curves over finite fields provide an inexhaustible s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->