Bitwise Linear Mappings with Good Cryptographic Properties and Efficient Implementation, by S. M. Dehnavi and A. Mahmoodi Rishakani and M. R. Mirzaee Shamsabad
Linear mappings are crucial components of symmetric ciphers. A special type of linear mappings are
(0,1)-matrices which have been used in symmetric ciphers such as ARIA, E2 and Camellia as diffusion
layers with efficient implementation. Bitwise linear maps are also used in symmetric ciphers such as
SHA family of hash functions and HC family of stream ciphers. In this article, we investigate a special
kind of linear mappings: based upon this study, we propose several linear mappings with only XOR and
rotation operations. The corresponding matrices of these mappings can be used in either the former case
as (0,1)-matrices of maximal branch number or in the latter case as linear mappings with good cryptographic
properties. The proposed mappings and their corresponding matrices can be efficiently implemented both
in software and hardware.
• Research Fellow/Postdoctoral Researcher in Applied Crypto, University of Auckland, Auckland, New Zealand
The Computer Science department at the University of Auckland seeks a Research Fellow/Postdoctoral Researcher to join the cloud security team led by Dr Giovanni Russello.
This research will take place in a new MBIE-funded Cyber Security STRATUS (Security Technologies Returning Accountability, Transparency and User-centric Services to the Cloud) project and will be in collaboration with University of Waikato, UniTech, the Cloud Security Alliance, and several New Zealand-based industrial partners (https://stratus.org.nz). The aim is to research novel yet practical cloud security tools to be adopted by the industry partners.
The research conducted by the University of Auckland’s team will focus on applied cryptography for retrieval and processing of encrypted data in outsourced and untrusted environments. This involves a substantial program of research to develop, implement and apply to industrial case studies.
This is a full time post for a fixed-term of 2 years. Salary starts at 74,000 NZD per annum.
Applicants should have a PhD in computer science in a relevant field (cloud security with emphasis on crypto solutions) a demonstrable research interest in the area of applied crypto with emphasis in homomorphic encryption for encrypted data processing and retrieval focusing on cloud computing, and experience in designing, analysing, and efficiently implement novel crypto algorithms. Previous experience in the area of big data with emphasis on privacy/confidentiality would be advantageous.
Host Institution: The University of Auckland is New Zealand\'s leading university. In the 2013 QS survey, the Computer Science Department ranked 38th. The University of Auckland has a strong international focus and is the only New Zealand member of Universitas 21 and the Association of Pacific Rim Universities - international consortia of research-led universities. Auckland is ranked third out of 221 world citie
A revocable anonymity in Tor, by Amadou Moctar Kane
This new protocol is based on the idea of introducing a revocable anonymity in Tor, which was presented in our recent paper entitled \"Another Tor is possible\". Compared to that previous paper, this present scheme simplify the first protocol and reduce the power of the directory server, while maintaining the ability for the Tor community, to break the anonymity of a sender in case of misconduct.
We also take the opportunity of this paper, to appeal the majors internet companies, to help in the creation of a responsible Tor network (without pedophiles, spies, ....), by mixing billions of data flowing through their networks with those of Tor.
Statistical Properties of Multiplication mod $2^n$, by A. Mahmoodi Rishakani and S. M. Dehnavi and M. R. Mirzaee Shamsabad and Hamidreza Maimani and Einollah Pasha
In this paper, we investigate some statistical properties of multiplication mod $2^n$ for cryptographic use.
For this purpose, we introduce a family of T-functions similar to modular multiplication, which we call
M-functions as vectorial Boolean functions. At first, we determine the joint probability distribution of
arbitrary number of the output of an M-function component bits. Then, we obtain the probability distribution
of the component Boolean functions of combination of a linear transformation with an M-function. After that,
using a new measure for computing the imbalance of maps, we show that the restriction of the output of an
M-function to its upper bits is asymptotically balanced.