Skip to search formSkip to main contentSkip to account menu
Pairing-Friendly Elliptic Curves of Prime Order
TLDR
This paper describes a method to construct elliptic curves of prime order and embedding degree k = 12 and shows that the ability to handle log(D)/log(r) ~ (q–3)/(q–1) enables building curves with ρ ~ q/(q-1).
View via Publisher
Efficient Algorithms for Pairing-Based Cryptosystems
TLDR
New techniques to implement recent cryptosystems based on the Tate pairing improve pairing evaluation speed by a factor of about 55 compared to previously known methods in characteristic 3, and attain performance comparable to that of RSA in larger characteristics.
View via Publisher
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
TLDR
This work proposes two McEliece variants: one from Moderate Density Parity-Check (MDPC) codes and another from quasi-cyclic MDPC codes, which reduce under certain hypotheses the security of the scheme to the well studied decoding problem.
View on IEEE
Efficient pairing computation on supersingular Abelian varieties
TLDR
A general technique for the efficient computation of pairings on Jacobians of supersingular curves is presented, which is called the eta pairing, and which leads to a new algorithm which is about twice as fast as the Duursma–Lee method.
View on Springer
Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
TLDR
A new identity-based signcryption (IBSC) scheme built upon bilinear maps is described that is more efficient than all others proposed so far and also faster than all known pairing-based IBS methods.
View via Publisher
Constructing Elliptic Curves with Prescribed Embedding Degrees
TLDR
Criteria for curves with larger k that generalize prior work by Miyaji et al. based on the properties of cyclotomic polynomials are examined, and efficient representations for the underlying algebraic structures are proposed.
View via Publisher
A New Two-Party Identity-Based Authenticated Key Agreement
We present a new two-party identity-based key agreement that is more efficient than previously proposed schemes. It is inspired on a new identity-based key pair derivation algorithm first proposed by…
View via Publisher
Compact McEliece Keys from Goppa Codes
TLDR
A simple way to reduce significantly the key size in McEliece and related cryptosystems using a subclass of Goppa codes, while also improving the efficiency of cryptographic operations to $\tilde{O}(n)$ time, and keeping the capability of correcting the full designed number of errors in the binary case is described.
View via Publisher
BIKE: Bit Flipping Key Encapsulation
TLDR
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not, for teaching and research institutions in France or abroad, or from public or private research centers.
Demonstrating data possession and uncheatable data transfer
TLDR
A protocol based on a certain RSA-based secure hash function is described, which prevents ‘cheating’ in a data transfer transaction, while placing little burden on the trusted third party that oversees the protocol.
View Paper
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License