@article{Kalimoldayev Maksat_Tynymbayev Sakhybay_Ibraimov Margulan_Magzom Miras_Kozhagulov Yeldos_Namazbayev Timur_2020, title={PIPELINE MULTIPLIER OF POLYNOMIALS MODULO WITH ANALYSIS OF HIGH-ORDER BITS OF THE MULTIPLIER}, url={https://journals.nauka-nanrk.kz/bulletin-science/article/view/565}, abstractNote={<p>Among public-key cryptosystems, cryptosystems built on the basis of a polynomial system of<br>residual classes are special. Because in these systems, arithmetic operations are performed at high speed. There are<br>many algorithms for encrypting and decrypting data presented in the form of polynomials. The paper considers data<br>encryption based on the multiplication of polynomials modulo irreducible polynomials. In such a multiplier, the<br>binary image of a multiply polynomial can serve as a fragment of encrypted text. The binary image of the multiplier<br>polynomial is the secret key and the binary representation of the irreducible polynomial is the module.<br>Existing sequential polynomial multipliers and single-cycle matrix polynomial multipliers modulo do not<br>provide the speed required by the encryption block. The paper considers the possibility of multiplying polynomials<br>modulo on a Pipeline in which architectural techniques are laid in order to increase computing performance.<br>In the conclusion of the work, the time gain of the multiplication modulo is shown by the example of the<br>multiplication of five triples of polynomials. Verilog language was used to describe the scheme of the Pipeline<br>multiplier. Used FPGA Artix-7 from Xilinx companies.<br>The developed Pipeline multiplier can be used for cryptosystems based on a polynomial system of residual<br>classes, which can be implemented in hardware or software.</p>}, number={4}, journal={Научный журнал «Вестник НАН РК» }, author={Kalimoldayev Maksat and Tynymbayev Sakhybay and Ibraimov Margulan and Magzom Miras and Kozhagulov Yeldos and Namazbayev Timur}, year={2020}, month={авг.}, pages={13–20} }