2 research outputs found

    Fast Multiple Point Multiplication on Elliptic Curves over Prime and Binary Fields using the Double-Base Number System

    Get PDF
    Multiple-point multiplication on elliptic curves is the highest computational complex operation in the elliptic curve cyptographic based digital signature schemes. We describe three algorithms for multiple-point multiplication on elliptic curves over prime and binary fields, based on the representations of two scalars, as sums of mixed powers of 2 and 3. Our approaches include sliding window mechanism and some precomputed values of points on the curve. A proof for formulae to calculate the number of double-based elements, doublings and triplings below 2^n is listed. Affine coordinates and Jacobian coordinates are considered in both prime fields and binary fields. We have achieved upto 24% of improvements in new algorithms for multiple-point multiplication

    ΠœΠΎΠ΄ΠΈΡ„Ρ–ΠΊΠΎΠ²Π°Π½ΠΈΠΉ ΠΌΠ΅Ρ‚ΠΎΠ΄ Π±Π°Π³Π°Ρ‚ΠΎΠΊΡ€Π°Ρ‚Π½ΠΎΠ³ΠΎ скалярного мноТСнння Ρ‚ΠΎΡ‡ΠΎΠΊ Π΅Π»Ρ–ΠΏΡ‚ΠΈΡ‡Π½ΠΎΡ— ΠΊΡ€ΠΈΠ²ΠΎΡ— Ρƒ скінчСнних полях

    Get PDF
    Π”Π°Π½ΠΈΠΉ Π΄ΠΈΠΏΠ»ΠΎΠΌΠ½ΠΈΠΉ ΠΏΡ€ΠΎΠ΅ΠΊΡ‚ присвячСний Ρ€ΠΎΠ·Ρ€ΠΎΠ±Π»Π΅Π½Π½ΡŽ ΠΌΠΎΠ΄ΠΈΡ„Ρ–ΠΊΠ°Ρ†Ρ–Ρ— ΠΌΠ΅Ρ‚ΠΎΠ΄Ρƒ Π±Π°Π³Π°Ρ‚ΠΎΠΊΡ€Π°Ρ‚Π½ΠΎΠ³ΠΎ скалярного мноТСння Ρ‚ΠΎΡ‡ΠΎΠΊ Π΅Π»Ρ–ΠΏΡ‚ΠΈΡ‡Π½ΠΎΡ— ΠΊΡ€ΠΈΠ²ΠΎΡ— Ρƒ скінчСнних полях. Π”Π°Π½Π° Ρ€ΠΎΠ·Ρ€ΠΎΠ±ΠΊΠ° прСдставляє собою ΠΏΡ€ΠΎΠ³Ρ€Π°ΠΌΠ½ΠΈΠΉ комплСкс для виконання ΠΎΠΏΠ΅Ρ€Π°Ρ†Ρ–ΠΉ Π½Π°Π΄ Ρ‚ΠΎΡ‡ΠΊΠ°ΠΌΠΈ Π΅Π»Ρ–ΠΏΡ‚ΠΈΡ‡Π½ΠΎΡ— ΠΊΡ€ΠΈΠ²ΠΎΡ—, Π·ΠΎΠΊΡ€Π΅ΠΌΠ° ΠΎΠΏΠ΅Ρ€Π°Ρ†Ρ–Ρ— Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΠΎ-Ρ†ΠΈΡ„Ρ€ΠΎΠ²ΠΎΠ³ΠΎ підпису Π²ΠΊΠ»ΡŽΡ‡Π½ΠΎ Π· ΠΏΡ€ΠΎΠ³Ρ€Π°ΠΌΠ½ΠΎΡŽ Ρ€Π΅Π°Π»Ρ–Π·Π°Ρ†Ρ–Ρ”ΡŽ Ρ–ΡΠ½ΡƒΡŽΡ‡ΠΈΡ… Ρ‚Π° Ρ€ΠΎΠ·Ρ€ΠΎΠ±Π»Π΅Π½ΠΎΠ³ΠΎ ΠΌΠ΅Ρ‚ΠΎΠ΄Ρƒ Π±Π°Π³Π°Ρ‚ΠΎΠΊΡ€Π°Ρ‚Π½ΠΎΠ³ΠΎ скалярного мноТСння Ρ‚ΠΎΡ‡ΠΎΠΊ Π΅Π»Ρ–ΠΏΡ‚ΠΈΡ‡Π½ΠΎΡ— ΠΊΡ€ΠΈΠ²ΠΎΡ— Π½Π° число. Π€ΡƒΠ½ΠΊΡ†Ρ–ΠΎΠ½Π°Π»ΡŒΠ½Ρ–ΡΡ‚ΡŒ ΠΏΡ€ΠΎΠ³Ρ€Π°ΠΌΠ½ΠΎΠ³ΠΎ комплСксу Π·Π°Π±Π΅Π·ΠΏΠ΅Ρ‡ΡƒΡ” виконання Π°Ρ€ΠΈΡ„ΠΌΠ΅Ρ‚ΠΈΡ‡Π½ΠΈΡ… ΠΎΠΏΠ΅Ρ€Π°Ρ†Ρ–ΠΉ Π½Π°Π΄ Ρ‚ΠΎΡ‡ΠΊΠ°ΠΌΠΈ Π΅Π»Ρ–ΠΏΡ‚ΠΈΡ‡Π½ΠΎΡ— ΠΊΡ€ΠΈΠ²ΠΎΡ— як Ρ‚ΠΎ додавання, віднімання, мноТСння Ρ‚ΠΎΡ‡ΠΊΠΈ Π½Π° число, знаходТСння ΠΎΠ±Π΅Ρ€Π½Π΅Π½ΠΎΡ— Ρ‚ΠΎΡ‡ΠΊΠΈ, Π° Ρ‚Π°ΠΊΠΎΠΆ обчислСння Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΠΎ-Ρ†ΠΈΡ„Ρ€ΠΎΠ²ΠΎΠ³ΠΎ підпису Ρ‚Π° ΠΉΠΎΠ³ΠΎ ΠΏΠ΅Ρ€Π΅Π²Ρ–Ρ€ΠΊΠ°. Π£ Π΄Π°Π½ΠΎΠΌΡƒ Π΄ΠΈΠΏΠ»ΠΎΠΌΠ½ΠΎΠΌΡƒ ΠΏΡ€ΠΎΠ΅ΠΊΡ‚Ρ– Ρ€ΠΎΠ·Ρ€ΠΎΠ±Π»Π΅Π½ΠΎ: Π°Ρ€Ρ…Ρ–Ρ‚Π΅ΠΊΡ‚ΡƒΡ€Ρƒ ΠΏΡ€ΠΎΠ³Ρ€Π°ΠΌΠ½ΠΎΠ³ΠΎ комплСксу, ΠΌΠΎΠ΄ΡƒΠ»ΡŒ ΠΎΠΏΠ΅Ρ€Π°Ρ†Ρ–ΠΉ Ρƒ скінчСнних полях, ΠΌΠΎΠ΄ΡƒΠ»ΡŒ ΠΎΠΏΠ΅Ρ€Π°Ρ†Ρ–ΠΉ Ρ–Π· Ρ‚ΠΎΡ‡ΠΊΠ°ΠΌΠΈ Π΅Π»Ρ–ΠΏΡ‚ΠΈΡ‡Π½ΠΎΡ— ΠΊΡ€ΠΈΠ²ΠΎΡ—, ΠΌΠΎΠ΄ΡƒΠ»ΡŒ Π΅Π»Π΅ΠΊΡ‚Ρ€ΠΎΠ½Π½ΠΎ-Ρ†ΠΈΡ„Ρ€ΠΎΠ²ΠΎΠ³ΠΎ підпису.This diploma project is devoted to the development of the modification of the method of multiple scalar multiplication of the points of an elliptic curve in finite fields. This development is a software package for performing operations on points of an elliptic curve, in particular electronic digital signature operations, including the program implementation of the existing and developed method of multiple scalar multiplication of points of an elliptic curve to a number. The functionality of the software complex provides execution of arithmetic operations over the points of the elliptic curve, such as adding, subtracting, multiplying a point by number, finding the inverse of a point, and calculating the digital signature and checking it. This project consists of: software architecture, operations module in finite fields, module of operations with points of an elliptic curve, module of electronic-digital signature
    corecore