搜索结果: 1-13 共查到“密码学 d-Sequence”相关记录13条 . 查询时间(0.093 秒)
Correlated Sequence Attack on Reduced-Round Simon-32/64 and Simeck-32/64
Correlated sequences Simon Simeck
2018/8/2
In this paper, we propose a novel cryptanalytic technique called correlated sequence attack on block ciphers. Our attack exploits the properties of given key dependent sequences of length tt to obtain...
Efficient Implementation of Keyless Signatures with Hash Sequence Authentication
digital signatures hash functions
2016/1/7
We present new ideas for decreasing the size of secure memory needed for hardware implementations
of hash-sequence based signatures proposed recently by Buldas, Laanoja and Truu (in the
following re...
SECOND COORDINATE SEQUENCE OF MP-LRS OVER NONTRIVIAL GALOIS RING OF ODD CHARACTERISTIC
linear recurrent sequence minimal polynomial rank estimations
2015/12/22
We investigate a well-known way to construct pseudo-random sequences by separation
p-adic coordinate sequences of linear recurrences over Galois ring. Commonly
it is necessary to know rank estimatio...
Golden Sequence for the PPSS Broadcast Encryption Scheme with an Asymmetric Pairing
broadcast encryption asymetric pairings
2014/3/11
Broadcast encryption is conventionally formalized as broadcast encapsulation in which, instead of a cipher- text, a session key is produced, which is required to be indistinguishable from random. Such...
Bias in the nonlinear filter generator output sequence
Bias nonlinear filter generator output sequence
2010/3/16
Nonlinear filter generators are common components used in
the keystream generators for stream ciphers and more recently for authentication
mechanisms. They consist of a Linear Feedback Shift Registe...
Efficient RFID authentication protocols based on pseudorandom sequence generators
authentication protocol pseudorandom sequence generator stream cipher
2009/6/5
In this paper, we introduce a new class of PRSGs, called par-
titioned pseudorandom sequence generators(PPRSGs), and propose an
RFID authentication protocol using a PPRSG, called S-protocol. Since
...
2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting Symbols within One Period k
Periodic Binary Sequence 2-Adic Complexity k-symbol deletion
2009/6/5
In this paper, we propose a method to get the lower bounds of the 2-adic complexity of a sequence obtained from a periodic sequence over by either inserting or deleting symbols within one period. The ...
We introduce a novel technique for computation of consecutive preimages of hash
chains. Whereas traditional techniques have a memory-times-computation complexity of
O(n) per output generated, the co...
We introduce a novel amortization technique for computation of consecutive preim-
ages of hash chains, given knowledge of the seed. While all previously known techniques
have a memory-times-computat...
A sequence approach to linear perfect hash families
sequence approach linear perfect hash families
2009/3/19
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a
field F of order q consists of a set S = { 1, . . . , s} of linear functionals from V to F
with the followin...
A d-Sequence based Recursive Random Number Generator
d-Sequence Recursive Random Number Generator
2008/12/17
Binary d-sequences were investigated for their cryptographic properties by Subhash Kak in [1,2], who also examined their application to watermarking [3], and made a proposal for their use as random nu...
Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms
DES Cracker TMTO Counter Mode of Operation LFSR
2008/10/27
We consider the problem of efficiently generating sequences in hardware for use in certain
cryptographic algorithms. The conventional method of doing this is to use a counter. We show that
sequences...
Somos Sequence Near-Addition Formulas and Modular Theta Functions
Somos Sequence Near-Addition Formulas Modular Theta Functions
2008/9/9
We have discovered conjectural near-addition formulas for Somos sequences. We have preliminary evidence suggesting the existence of modular theta functions.