نتایج جستجو برای: position based cryptography
تعداد نتایج: 3129196 فیلتر نتایج به سال:
In a series of three lectures, we will introduce the main concepts behind torus-based cryptography. Algebraic tori were suggested in 2003 by K. Rubin and A. Silverberg for use in public-key cryptography. Torus-based cryptosystems are based on the Discrete Logarithm Problem in a subgroup of Fqn called the primitive subgroup. It is conjectured that the elements of the primitive subgroup can be re...
we give a survey of recent applications of group rings to combinatorics and tocryptography, including their use in the di erential cryptanalysis of block ciphers.
In this paper, neural network based cryptology is performed. The system consists of two stages. In the first stage, neural network-based pseudo-random numbers (NPRNGs) are generated and the results are tested for randomness using National Institute of Standard Technology (NIST) randomness tests. In the second stage, a neural network-based cryptosystem is designed using NPRNGs. In this cryptosys...
Blind signature is a special digital that allows the signer to sign document without knowing its content. However, in many situations, multiple people need blindly messages. At this time, traditional blind can no longer satisfy application requirements. To solve problem, attribute-based cryptography has been combined with signature. The concept of generated. present, all schemes require support...
We propose new multivariate cryptosystems over n-dimensional vector space over a finite field Fq based on idea of hidden discrete logarithm problem for F ∗ q. These cryptosystems are based on hidden eulerian equations x = a, (α, q − 1) = 1. The method is based on the idea of Eulerian transformations, which allow us to use asymmetric algorithms based on families of nonlinear multiplicatively inj...
We introduce the concept of torus-based cryptography, give a new public key system called CEILIDH, and compare it to other discrete log based systems including Lucas-based systems and XTR. Like those systems, we obtain small key sizes. While Lucas-based systems and XTR are essentially restricted to exponentiation, we are able to perform multiplication as well. We also disprove the open conjectu...
Recent research has considered DNA as a medium for ultra-scale computation and for ultracompact information storage. One potential key application is DNA-based, molecular cryptography systems. We present some procedures for DNA-based cryptography based on one-time-pads that are in principle unbreakable. Practical applications of cryptographic systems based on onetime-pads are limited in convent...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید