This document describes three Elliptic Curve Cryptography (ECC) groups for use in the Internet Key Exchange (IKE) and Internet Key Exchange version 2 (IKEv2) protocols in addition to previously defined groups. These groups are based on modular arithmetic rather than binary arithmetic. These groups are defined to align IKE and IKEv2 with other ECC implementations and standards, particularly NIST...

This document describes three Elliptic Curve Cryptography (ECC) groups for use in the Internet Key Exchange (IKE) and Internet Key Exchange version 2 (IKEv2) protocols in addition to previously defined groups. These groups are based on modular arithmetic rather than binary arithmetic. These groups are defined to align IKE and IKEv2 with other ECC implementations and standards, particularly NIST...

We propose a general approach for differentially private synthetic data generation, that consists of three steps: (1) select collection low-dimensional marginals, (2) measure those marginals with noise addition mechanism, and (3) generate preserves the measured well. Central to this is Private-PGM, post-processing method used estimate high-dimensional distribution from noisy measurements its ma...

Grover search algorithm is the most representative quantum attack method that threatens security of symmetric key cryptography. If applied to cryptography, level target cryptography can be lowered from n-bit n2-bit. When applying Grover’s block cipher potential attacks, must implemented as circuits. Starting with AES cipher, a number works have been conducted optimize and implement ciphers into...

A decentralised authorisation mechanism is proposed that uses Bloom filters to implement authorization delegation. This lightweight mechanism is unlike conventional approaches that typically rely on public key certificates to implement distributed delegation. In taking an approach based on one-way hash functions, the mechanism may be preferable for use in computationally constrained environment...

In 1998, Tseng and Jan proposed a lightweight interactive user identification protocol based on ID-based cryptography. Recently, Hwang et al. modified their protocol to reduce the responding and waiting time for wireless network applications. In this letter, we show that their scheme is vulnerable to impersonation attacks. key words: cryptanalysis, user identification, ID-based cryptosystem, wi...

We remark that the structure of bilinear groups of a large composite order (at least 1024 bits) could make group operation inefficient and lose the advantages of elliptic curve cryptography which gained mainly from smaller parameter size. As of 2013, the longest parameter recommended by NIST for elliptic curves has 571 bits. From the practical point of view, such an algebraic structure is unlik...

Lightweight trust mechanism with lightweight cryptography primitives and post-quantum cryptosystems are having important concerns in resource constraint wireless sensor based Mobile Ad Hoc Networks (MANETs). In postquantum cryptosystems, error correcting codes (ECC) help in code based cryptography for lightweight identification, authentication, distance bounding and tag with ownership transfer ...