To obtain access to full text of journal and articles you must register!
- Article name
- Synthesis of the algebraic block ciphers based on using the operations over binary polynomials
- Authors
- Moldovyan N. A., , nmold@mail.ru, St. Petersburg Federal Research Center of the RAS (SPC RAS), St. Petersburg, Russia
Al-Rahmi Ramzi Yahya, , ryms84@mail.ru, St.-Petersburg State Electrotechnical University LETI, Russia
- Keywords
- block cipher / data encryption / polynomial multiplication / finite fields / irreducible polynomials / binary polynomials / statistic properties
- Year
- 2012 Issue 1 Pages 2 - 7
- Code EDN
- Code DOI
- Abstract
- It is considered construction of the block ciphers based on using the operations over the polynomials. The 32-bit and 64-bit data subblocks are interpreted as binary polynomials. The multiplication of the binary polynomials modulo an irreducible polynomial is the main cryptographic primitive in the proposed encryption algorithm. Security of the ciphers is provided by combining multiplication operations modulo polynomials of different degrees. To increase the performance of the ciphers there are used binary polynomials. It is described the irreducibility test used for generating irreducible polynomials.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy
