[go: up one dir, main page]

Kamal et al., 2009 - Google Patents

An FPGA implementation of the NTRUEncrypt cryptosystem

Kamal et al., 2009

View PDF
Document ID
2820933692873980456
Author
Kamal A
Youssef A
Publication year
Publication venue
2009 International Conference on Microelectronics-ICM

External Links

Snippet

The NTRU encryption algorithm, also known as NTRUEncrypt, is a parameterized family of lattice-based public key cryptosystems. Both the encryption and decryption operations in NTRU are based on simple polynomial multiplication which makes it very fast compared to …
Continue reading at users.encs.concordia.ca (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/3066—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
    • H04L9/3073—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/725—Finite field arithmetic over elliptic curves
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/08—Randomization, e.g. dummy operations or using noise
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation

Similar Documents

Publication Publication Date Title
Kamal et al. An FPGA implementation of the NTRUEncrypt cryptosystem
Roy et al. Tile before multiplication: An efficient strategy to optimize DSP multiplier for accelerating prime field ECC for NIST curves
Rajasekar et al. Design and implementation of power and area optimized AES architecture on FPGA for IoT application
Sahu et al. FPGA implementation of RSA encryption system
Morales-Sandoval et al. Area/performance trade-off analysis of an FPGA digit-serial GF (2m) Montgomery multiplier based on LFSR
CN102098156A (en) Improvement and correlative improvement in cryptographically transforming data text
Yoshioka Security of Public-Key Cryptosystems Based on Chebyshev Polynomials Over $\mathbb Z/p^{k}\mathbb Z$
Do-Nguyen et al. Multi-functional resource-constrained elliptic curve cryptographic processor
Panjwani Scalable and parameterized hardware implementation of elliptic curve digital signature algorithm over prime fields
Park et al. FPGA and ASIC implementation of ECC processor for security on medical embedded system
Zalekian et al. Efficient implementation of NTRU cryptography using residue number system
CN102043606B (en) Method and operation circuit for dealing with finite field operations
Beuchat FPGA implementations of the RC6 block cipher
El-Hadedy et al. High performance implementation of a public key block cipher-mqq, for fpga platforms
Gnanasekaran et al. Efficient RSA crypto processor using montgomery multiplier in FPGA
Shams et al. Cryptosystem an Implementation of RSA using Verilog
Hu et al. NTRU‐based sensor network security: a low‐power hardware implementation perspective
Coman et al. Cryptographic applications using FPGA technology
Praphul et al. FPGA implementation of hybrid cryptosystem
Selva Kumar et al. Network Data Security Using FPGA
Anoop et al. Performance analysis of montgomery multiplier
Al-Haija et al. Cost-Effective FPGA Implementation of Parallel Schmidt-Samoa Cryptosystem (SSC)
Nagaraja et al. A unified architecture for a dual field ECC processor applicable to AES
Yu Design of highly efficient elliptic curve crypto-processor with two multiplications over GF (2163)
Kodali et al. FPGA implementation of energy efficient multiplication over GF (2 m) for ECC