Results 281 to 290 of about 1,067,462 (345)
Robust Access Control for Secure IoT Outsourcing with Leakage Resilience. [PDF]
Sensors (Basel)Riad K.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Emerging Security Algorithms and Techniques, 2019
Khaleel Ahmad +2 more
semanticscholar +3 more sources
Khaleel Ahmad +2 more
semanticscholar +3 more sources
The Discrete Logarithm Problem [PDF]
, 1993 There are many public-key cryptosystems whose security lies in the presumed intractability of the discrete logarithm problem in some group G. The discrete logarithm problem has received a great deal of attention in recent years, and numerous algorithms which use a variety of techniques have been devised.
Tomik Yaghoobian +4 more
openaire +3 more sources
Test embedding with discrete logarithms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995When using Built-In Self Test (BIST) for testing VLSI circuits, a major concern is the generation of proper test patterns that detect the faults of interest. Usually a linear feedback shift register (LFSR) is used to generate test patterns. We first analyze the probability that an arbitrary pseudo-random test sequence of short length detects all faults.
M.A. Breuer, S.K. Gupta, M. Lempel
openaire +2 more sources
An efficient blind signature scheme based on the elliptic curve discrete logarithm problem
ISC Int. J. Inf. Secur., 2015Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented.
M. Nikooghadam, A. Zakerolhosseini
semanticscholar +1 more source
Discrete logarithms for finite groups
Computing, 2009We present group-theoretic and cryptographic properties of a generalization of the traditional discrete logarithm problem from cyclic to arbitrary finite groups. Questions related to properties which contribute to cryptographic security are investigated, such as distributional, coverage and complexity properties.
Michal Sramka +3 more
openaire +2 more sources
Integer Factorization and Discrete Logarithms
2004The integer factorization problem (IFP) is to find a nontrivial factor f (not necessarily prime) of a composite integer n.
Song Y. Yan, Song Y. Yan
openaire +2 more sources
Practical Solving of Discrete Logarithm Problem over Prime Fields Using Quantum Annealing
International Conference on Conceptual Structures, 2022Michał Wroński
semanticscholar +1 more source