نتایج جستجو برای: cryptology
تعداد نتایج: 644 فیلتر نتایج به سال:
Lattices are regular arrangements of points in n-dimensional space, whose study appeared in the 19th century in both number theory and crystallography. Since the appearance of the celebrated Lenstra-Lenstra-Lovv asz lattice basis reduction algorithm twenty years ago, lattices have had surprising applications in cryptology. Until recently, the applications of lattices to cryptology were only neg...
On Applications of Simulated Annealing to Cryptology
Counting letters in written texts is a very ancient practice. It has accompanied the development of Cryptology, Quantitative Linguistics, and Statistics. In Cryptology, counting frequencies of the different characters in an encrypted message is the basis of the so called frequency analysis method. In Quantitative Linguistics, the proportion of vowels to consonants in different languages was stu...
We give a review of some known published applications of quasigroups in cryptology.
In this talk, I will review some of the work performed by the research community in cryptology and security since the invention of public key cryptography by Diffie and Hellman in 1976. This community has developped many challenging lines of research. I will only focus on some of these, and moreover I will adopt an extremely specific perspective: for each chosen example, I will try to trace the...
This paper is an in depth exploration of the fashion object and device, the Play-A-Grill. It details inspirations, socio-cultural implications, technical function and operation, and potential applications for the Play-A-Grill system.
Thermal referral (TR) and thermal grill illusion (TGI), known as illusions of thermal sensation, have been well studied. In a previous study, an experiment using two thermal-tactile stimulations to the forearm revealed that these illusions simultaneously occurred. In this experiment result, a few subjects perceived a hot stimulation as a cold sensation and/or a cold stimulation as a hot sensati...
These notes informally review the most common methods from computational number theory that have applications in public key cryptology.
Lattices are regular arrangements of points in space, whose study appeared in the 19th century in both number theory and crystallography. The goal of lattice reduction is to nd useful representations of lattices. A major breakthrough in that eld occurred twenty years ago, with the appearance of Lovv asz's reduction algorithm, also known as LLL or L 3. Lattice reduction algorithms have since pro...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید