A wireless sensor network (WSN) consists of a set of sensor nodes that are widely scattered in inaccessible areas When deployed in large areas, WSNs generate a large volume of the data Therefore, efficient methods are needed to process the data One solution to minimize traffic on large-scale wireless sensor networks is to use data aggregation schemes In this paper, a secure data aggregation method is proposed The proposed secure data aggregation scheme has three phases: intra-cluster data aggregation, inter-cluster data aggregation, and data transfer In the intra-cluster data aggregation phase, a fuzzy scheduling system is designed to adjust the appropriate data transmission rates of the cluster member nodes In the inter-cluster data aggregation phase, an aggregation tree is created between the cluster head nodes The dragonfly algorithm (DA) is used to find the optimal aggregation tree between cluster head nodes In the data transfer phase, the columnar transposition cipher method is used to establish a secure connection between cluster member nodes and their cluster head node Also, a symmetric and lightweight encryption method based on the residue number system (RNS) is utilized to provide secure communications between the cluster head nodes We modify RNS and call it RNS+ Finally, the simulation results of the proposed scheme are compared to three data aggregation methods including Sign-share, Sham-share, and RCDA The results show that the proposed data aggregation scheme outperforms other data aggregation methods in terms of network lifetime, delay and packet delivery rate

A hierarchical secure data aggregation method using the dragonfly algorithm in wireless sensor networks

Many historians and linguists are working individually and in an uncoordinated fashion on the identification and decryption of historical ciphers. This is a time-consuming process as they often wor...

Decryption of historical manuscripts: the DECRYPT project

In wireless sensor networks, the sensors transfer data through radio signals to a remote base station. Sensor nodes are used to sense environmental conditions such as temperature, strain, humidity,...

https://journals.sagepub.com/doi/pdf/10.1177/1550147720925772

An efficient cryptographic technique using modified Diffie–Hellman in wireless sensor networks:

(t,m) [?]. (t, n) [?, ?]. $10.00 [?]. $12.00 [?]. 128 [?]. $139.99 [?]. $15.00 [?]. $16.95 [?]. $16.96 [?]. $18.95 [?]. $24.00 [?]. $24.00/$34 [?]. $24.95 [?, ?]. $26.95 [?]. $29.95 [?]. $30.95 [?]. $39 [?]. $43.39 [?]. $45.00 [?]. $5.95 [?]. $54.00 [?]. $54.95 [?]. $54.99 [?]. $6.50 [?]. $6.95 [?]. $69.00 [?]. $69.95 [?]. $75.00 [?]. $89.95 [?]. th [?]. A [?]. A [?, ?]. χ [?]. H [?]. k [?, ?]. M [?, ?]. M [?]. n [?, ?, ?].

/pdf/a-complete-bibliography-of-publications-in-cryptologia-19afbi1vz2.pdf

A Complete Bibliography of Publications in Cryptologia

Encoded (or ciphered) manuscripts are a special type of historical documents that contain encrypted text. The automatic recognition of this kind of documents is challenging because: 1) the cipher alphabet changes from one document to another, 2) there is a lack of annotated corpus for training and 3) touching symbols make the symbol segmentation difficult and complex. To overcome these difficulties, we propose a novel method for handwritten ciphers recognition based on few-shot object detection. Our method first detects all symbols of a given alphabet in a line image, and then a decoding step maps the symbol similarity scores to the final sequence of transcribed symbols. By training on synthetic data, we show that the proposed architecture is able to recognize handwritten ciphers with unseen alphabets. In addition, if few labeled pages with the same alphabet are used for fine tuning, our method surpasses existing unsupervised and supervised HTR methods for ciphers recognition.

A Few-shot Learning Approach for Historical Ciphered Manuscript Recognition

The double transposition cipher was considered to be one of the most secure types of manual ciphers. It was extensively used in both World Wars and during the Cold War. In 1999, Otto Leiberich, the former head of the German federal office for information security, suggested that a double transposition challenge be published with specific parameters designed to ensure its security. Such a challenge was published by Klaus Schmeh in 2007. In November 2013, the authors solved the challenge using a ciphertext-only hill climbing attack. They also solved the challenge using a dictionary attack. In this article, they describe both methods, which are based on a “divide-and-conquer” approach. They additionally discuss the impact of their solutions with respect to the general security of the double transposition cipher.

Solving the Double Transposition Challenge with a Divide-and-Conquer Approach

The classical columnar transposition cipher was the most popular type of transposition cipher. It was in use mainly during the second half of the nineteenth century and the first half of the twentieth century. It also served as a building block for more complex ciphers, such as the ADFGVX cipher and the double transposition cipher. Pen-and-paper as well as computerized methods for the cryptanalysis of the columnar transposition cipher have been published, but those apply mainly to the easier cases of short keys and complete transposition rectangles. In this article, a novel approach for the cryptanalysis of the columnar transposition cipher when used with long keys is presented. It is based on a two-phase hill climbing algorithm, a two-dimensional fitness score, and special transformations on key segments. This ciphertext-only method allows for the recovery of transposition keys with up to 1,000 elements, and up to 120 elements for worst case transposition rectangles.

Cryptanalysis of columnar transposition cipher with long keys

In Meister’s 1906 landmark study, “Die Geheimschrift im Dienste der papstlichen Kurie von ihren Anfangen bis zum Ende des XVI Jahrhunderts”, the 16th Century papal cryptographic service is describe

Deciphering papal ciphers from the 16th to the 18th Century

The analysis of the messages in their historical context provides a unique insight into key events, such as the withdrawal of the German troops from Romania, and the impact of the Kiel Mutiny on communications. Both events had major political and military consequences for Germany in the Eastern Front. Cryptanalysis allowed the Entente Powers to closely monitor those events as well as others developments, also highlighting inherent weaknesses in German cryptographic and cryptanalytic capabilities. The authors plan to publish online all the decrypted messages.

George Lasry

Papers

Decryption of historical manuscripts: the DECRYPT project

Solving the Double Transposition Challenge with a Divide-and-Conquer Approach

Cryptanalysis of columnar transposition cipher with long keys

Deciphering papal ciphers from the 16th to the 18th Century

Deciphering ADFGVX messages from the Eastern Front of World War I