Public-Key Cryptography Based on Modular Lattices
Cryptography and Security
2012-03-27 v1
Abstract
We present an approach to generalization of practical Identity-Based Encryption scheme of Boneh and Franklin. In particular we show how the protocol could be used on finite modular lattices and as a special case on vector spaces over finite field. The original proof of security for this protocol does not hold in this general algebraic structure, thus this is still a work in progress.
Keywords
Cite
@article{arxiv.1203.5350,
title = {Public-Key Cryptography Based on Modular Lattices},
author = {Frantisek Polach},
journal= {arXiv preprint arXiv:1203.5350},
year = {2012}
}