Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:
To receive your credentials via mail again, please click here.
You can also access the full news archive.
numbers, a ciphertext of $2n$ rational numbers is used. The security is based on the fact that there are infinitely many solutions of a system with $2n$ polynomial equations of $3n$ unknowns.
The public key is designed by quasigroup transformations obtained from quasigroups presented in matrix form. The quasigroups presented in matrix form allow numerical as well as symbolic computations, and here we exploit that possibility. The private key consists of several $1\\times n$ and $n\\times n$ matrices over $\\mathbb Q$, and one $2n\\times 2n$ matrix.
is most important. In this search from the infinite domain of integers,cases where rejection of integers for the existence of Generalized bent
function is very helpful. With the help of some necessary condition
of GBF here we show the non existence of [n,5] type Generalized Bent