Identity-Based Cryptosystem plays an important role in the modern cryptography world, due to the elimination of the costly certificate. However, all practical identity-based encryption schemes require pairing operation in the decryption stage. Pairing is a heavy mathematical algorithm, especially for resource-constrained devices such as smart cards or wireless sensors. In other words, decryptio...

A cryptosystem for wireless communications, recently proposed by T. Dean and A. Goldsmith, is considered. That system can be regarded as a second revolution in cryptography because the confidentiality of the messages transmitted over a wireless massive MIMO-based channel is provided by the difference in the space locations of legal and illegal users and it does not require any secret key distri...

A periodical multi-secret threshold cryptosystem enables a sender to encrypt a message by using a cyclical sequence of keys which are shared by n parties and periodically updated. The same keys appear in the same order in each cycle, and thus any subset of t + 1 parties can decrypt the message only in the periodical time-frames, while no subset of t corrupted parties can control the system (in ...

In this paper we will propose the methods for finding the non-invertible ideals corresponding to non-primitive quadratic forms and clarify the structures of class semigroups of imaginary quadratic orders which were given by Zanardo and Zannier [8], and we will give a general algorithm for calculating power of ideals/classes via the Dirichlet composition of quadratic forms which is applicable to...

In its simplest form, it implements an unbreakable (in the information-theoretical sense) cryptosystem, rather similar to the one-time pad, with the additional twist that decryption does not require any computing equipment. James Bond carries a special “key” which is in fact a transparency with lots of random dots on it; when M faxes Bond a secret message, it too consisting of lots of random do...

This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the “memory attack”, was proposed recently. In this attack, a significant fraction of the bits of a secret key of a cryptographic algorithm can be measured by an adversary if the secret key is ever stored in a part of memory...

Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this model, the system remains secure even in the presence of a certain threshold t of corrupted/malicious nodes. In this paper, we show how to perform necessary public key operations without node-specific certificates in ad hoc ne...

The well-known RSA public key cryptosystem is nowadays used in a wide variety of applications ranging from web browsers to smart cards. Since its initial publication in 1977, many researchers have tried to look for vulnerabilities in the system. Some clever attacks have been found. However, none of the known attacks is devastating and the RSA system is still considered secure. In this lecture w...

The book here reviewed consists of several articles written by different authors. We provide below short characteristics of each of the articles in the book. 1. Efficient distributed computation modulo a shared secret (Dario Catalano) The article concerns the subject of distributed computation. This is realized by the secret sharing protocols. The author presents several kinds of such protocols...