Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Trapdooring Discrete Logarithms on Elliptic Curves over Rings
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Cryptocomputing with rationals
FC'02 Proceedings of the 6th international conference on Financial cryptography
An interpretation of identity-based cryptography
Foundations of security analysis and design IV
ICANCM'11/ICDCC'11 Proceedings of the 2011 international conference on applied, numerical and computational mathematics, and Proceedings of the 2011 international conference on Computers, digital communications and computing
Hidden pairings and trapdoor DDH groups
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Pairings on elliptic curves over finite commutative rings
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
An information aggregation scheme of multi-node in ubiquitous sensor networks
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 754.84 |
We present a new cryptosystem based on elliptic curves over the ring Zn, where n=pq, in which the message is held in the exponent and not the group element. The security of this system is based on the difficulty of factoring n. A digital signature scheme and ID-based key exchange system are also given