README
¶
Benaloh Cryptosystem
This package is implemented according to the pseudo-code and mathematical notations of the following algorithms of the Benaloh cryptosystem:
- Key Generation
- Encryption
- Decryption
Benaloh has additive homomorphic encryption property and is an example of Partially Homomorphic Encryption (PHE). Therefore, the multiplication of ciphers results in the sum of original numbers.
Moreover, it also supports the following PHE functions:
- Homomorphic Encryption over two ciphers
- Homomorphic Encryption over multiple ciphers
Installation
go get -u github.com/Mirzazhar/benaloh
Warning
This package is intendedly designed for education purposes. Of course, it may contain bugs and needs several improvements. Therefore, this package should not be used for production purposes.
⚠ Keys generation implementation is not efficient and it takes time to generate keys using large primes. The worst thing, it can generate keys up to the 32-bit size of prime numbers.
Limitations
In this implementation decryption algorithm works by taking the discrete log of a base x to recover original message m. It can only work if the value of R in the key is small. Otherwise, message m can be recovered using Baby-step giant-step algorithm in case of a large value of R.
Usage & Examples
Contribution
- You can fork this, extend it and contribute back.
- You can contribute with pull requests.
LICENSE
MIT License
References
Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
var ErrLargeCipher = errors.New("benaloh: cipher is larger than the public key size")
var ErrLargeMessage = errors.New("benaloh: message is larger than the public key size")
Functions ¶
This section is empty.
Types ¶
type PrivateKey ¶
PrivateKey represents a Benaloh private key.
func GenerateKey ¶
func GenerateKey(random io.Reader, bitsize int) (*PrivateKey, error)
GenerateKey generates the Benaloh private key of the given bit size.
func (*PrivateKey) Decrypt ¶
func (priv *PrivateKey) Decrypt(cipherText []byte) ([]byte, error)
Decrypt decrypts the passed cipher text. It returns an error if cipher text value is larger than modulus N of Public key. Moreover, this works by taking discrete log of a base x to recover original message m. It can only work, if R is small. Otherwise, message can be recovered using Baby-step giant-step algorithm in case of large value of R.
type PublicKey ¶
PublicKey represents Benaloh public key.
func (*PublicKey) Encrypt ¶
Encrypt encrypts a plain text represented as a byte array. It returns an error if plain text value is larger than R value of Public key.
func (*PublicKey) HommorphicEncMultiple ¶
HommorphicEncMultiple performs homomorphic operation over two chiphers. Benaloh has additive homomorphic property, so resultant cipher contains the sum of multiple numbers.
Source Files