搜索结果: 1-15 共查到“密码学 generalization”相关记录22条 . 查询时间(0.125 秒)
Deep Learning Model Generalization in Side-Channel Analysis
Side-Channel Analysis Deep Learning Model Generalization
2019/8/30
The adoption of deep neural networks for profiled side-channel attacks provides different capabilities for leakage detection of secure products. Research papers provide a variety of arguments with res...
On the Inner Product Predicate and a Generalization of Matching Vector Families
Predicate Encryption Inner Product Encoding Matching Vector Families
2018/11/7
Our main result is a simple lower bound that allows us to show that known encodings for many predicates considered in the cryptographic literature such as greater than and threshold are essentially op...
Cryptanalysis of a Group Key Transfer Protocol Based on Secret Sharing: Generalization and Countermeasures
Secret Sharing Group key transfer protocol Key agreement protocol
2018/8/2
Group key distribution protocol is a mechanism in which a group key is generated and distributed by KGC to a set of communicating parties in a group. This group key generally ensures secure communicat...
A New Generalization of the KMOV Cryptosystem
KMOV cryptosystem, Elliptic curves, Prime power modulus
2017/11/13
The KMOV scheme is a public key cryptosystem based on an RSA modulus n=pqn=pq where pp and qq are large prime numbers with p≡q≡2(mod3)p≡q≡2(mod3). It uses the points of an elliptic curve with equation...
Generalization of Statistical Criteria for Sboxes
Linear Crytptanaslysis Differential Cryptanalysis Differential-Linear Cryptanalysis
2016/1/4
Linear and differential cryptanalysis and their generalizations are
the most important tools in statistical analysis of symmetric ciphers. These
attacks make use of linear and differential propertie...
A generalization of the class of hyper-bent Boolean functions in binomial forms
Boolean functions bent functions hyper-bent functions
2012/6/14
Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were...
A generalization of the class of hyper-bent Boolean functions in binomial forms
foundations / Boolean functions bent functions hyper-bent functions Walsh-Hadamard transformation Kloosterman sums
2012/3/20
Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were...
On a new generalization of Huff curves
public-key cryptography / Huff curves pairing,divisor Jacobian Miller algorithm elliptic curve models Edwards curves Koblitz Curves
2012/3/21
Recently two kinds of Huff curves were introduced as elliptic curves models and their arithmetic was studied. It was also shown that they are suitable for cryptographic use such as Montgomery curves o...
A generalization of the class of hyper-bent Boolean functions in binomial forms
Boolean functions bent functions hyper-bent functions
2012/8/28
Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were...
A generalization of the Lucas addition chains
public-key cryptography addition chain addition-subtraction chain
2011/7/25
In this paper, we give a generalization of Lucas addition chains, where subtraction is allowed. We call them ''Lucas addition-subtraction chain''.
A generalization of the Lucas addition chains
public-key cryptography / addition chain addition-subtraction chain Lucas chains
2012/3/27
In this paper, we give a generalization of Lucas addition chains, where subtraction is allowed. We call them ''Lucas addition-subtraction chain''. We also show that this new method gives minimal addit...
On a new generalization of Huff curves
public-key cryptography / Huff curves pairing, divisor Jacobian Miller algorithm elliptic curve models Edwards curves Koblitz Curves
2012/3/23
Recently two kinds of Huff curves were introduced as elliptic curves models and their arithmetic was studied. It was also shown that they are suitable for cryptographic use such as Montgomery curves o...
Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition
foundations Multiparty Computation Constant Rounds Secret Sharing Bitwise Sharing Digit-wise Sharing
2010/7/13
Bit-decomposition, which is proposed by Damg{\aa}rd \emph{et al.}, is a powerful tool for multi-party computation (MPC). Given a sharing of secret \emph{a}, it allows the parties to compute the sharin...
Generalization of Barreto et al ID based Signcryption Scheme
ID based signcryption generalized signcryption multiple PKGs environment
2009/6/12
This paper presents an efficient and provable secure identity based
generalized signcryption scheme based on [1] which can work as signcryption
scheme, encryption scheme and signature scheme as per ...
On Generalization of Cheon’s Algorithm
discrete log problem generic algorithm Cheon’s algorithm
2009/6/11
Let G be a cyclic group generated by g whose group operations
are written additively. Assume that the order of G is a prime p.
Let d be a divisor of p+1. Let c 2 Fp. Given cg, c2g, . . ., c2dg, Cheo...