Explicit Weil-pairing for Drinfeld modules

The goal of this paper is to define an analogue of the Weil-pairing for Drinfeld modules using explicit formulas and to deduce its main properties from these formulas. Our result generalizes the formula given for rank 2 Drinfeld modules by van der Heiden and works as a more explicit, elementary proof of the Weil-pairing’s existence given by van der Heiden.

Storage and Communication Security in Cloud Computing Using a Homomorphic Encryption Scheme Based Weil Pairing

With introduction of smart things into our lives, cloud computing is used in many different areas and changes the communication method. However, cloud computing should guarantee the complete security assurance in terms of privacy protection, confidentiality, and integrity. In this paper, a Homomorphic Encryption Scheme based on Elliptic Curve Cryptography (HES-ECC) is proposed for secure data transfer and storage. The scheme stores the data in the cloud after encrypting them. While calculations, such as addition or multiplication, are applied to encrypted data on cloud, these calculations are transmitted to the original data without any decryption process. Thus, the cloud server has only ability of accessing the encrypted data for performing the required computations and for fulfilling requested actions by the user. Hence, storage and transmission security of data are ensured. The proposed public key HES-ECC is designed using modified Weil-pairing for encryption and additional homomorphic property. HES-ECC also uses bilinear pairing for multiplicative homomorphic property. Security of encryption scheme and its homomorphic aspects are based on the hardness of Elliptic Curve Discrete Logarithm Problem (ECDLP), Weil Diffie-Hellman Problem (WDHP), and Bilinear Diffie-Helman Problem (BDHP).

Cohen–Lenstra heuristics for étale group schemes and symplectic pairings

We generalize the Cohen–Lenstra heuristics over function fields to étale group schemes $G$ (with the classical case of abelian groups corresponding to constant group schemes). By using the results of Ellenberg–Venkatesh–Westerland, we make progress towards the proof of these heuristics. Moreover, by keeping track of the image of the Weil-pairing as an element of $\wedge ^{2}G(1)$, we formulate more refined heuristics which nicely explain the deviation from the usual Cohen–Lenstra heuristics for abelian $\ell$-groups in cases where $\ell \mid q-1$; the nature of this failure was suggested already in the works of Malle, Garton, Ellenberg–Venkatesh–Westerland, and others. On the purely large random matrix side, we provide a natural model which has the correct moments, and we conjecture that these moments uniquely determine a limiting probability measure.