Timing Constraints-Based High-Performance DES Design and Implementation on 28-nm FPGA

Thind, Vandana; Pandey, Sujeet; Hussain, Dil Muhammad Akbar; Das, Bhagwan; Abdullah, M. F. L.; Pandey, Bishwajeet

doi:10.1007/978-981-10-8533-8_13

Cited by 4 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These advantages include resistance against quantum attacks, efficient key generation, and strong security guarantees based on well-established hardness assumptions in lattice theory. Furthermore, lattice-based systems exhibit faster performance compared to factorization or discrete logarithm-based alternatives Learning With Errors (LWE) [9] Learning With Errors (LWE) is a fundamental problem in cryptography pertaining to lattices, which forms the basis for various encryption schemes and cryptographic primitives. LWE encryption offers strong security guarantees relying on the complexity of solving specific lattice problems, making it resistant against both classical and quantum attacks.…”

Section: A Lattice Based Encryption Algorithmsmentioning

confidence: 99%

“…In our application of the ECC algorithm on the Kintex UltraScale+ 16nm FPGA, we observed resource utilizations as follows: Only 0.29% of the available Lookup Tables (LUTs) and 0.14% of Flip-Flops (FF) were utilized. LUTs serve as basic logic elements, while FFs are used for storing state information and implementing sequential provide insights into the nature and characteristics of the ECC algorithm's implementation on the Kintex UltraScale+ FPGA, highlighting its efficient utilization of logic, state storage, IO, and clocking resources [9,15].…”

Section: A Resource Utilizationmentioning

confidence: 99%

“…The latticebased cryptographic systems leverage the hardness of certain problems associated with these structures, making them resistant to classical and quantum attacks. In this section, we will dive into the key concepts related to lattice structures, including lattice definitions, basis vectors, and lattice reduction algorithms [9]. A lattice can be explained as an infinite set of points in n-dimensional space [6](A lattice Λ in Z n is a collection of points represented as {x = (x1,x2,...,xn) ∈ Z n } such that the points are arranged in a regular, periodic pattern.)…”

mentioning

confidence: 99%

See 2 more Smart Citations

Implementation of lattice based Cryptograpy cyber forensic system

Kumari,

Anand,

Sharma

et al. 2024

Preprint

View full text Add to dashboard Cite

Lattice-based cryptography has emerged as a robust and promising framework for ensuring the security and resilience of cryptographic systems in the face of quantum computing threats. This research paper explores the recent advancements in lattice-based cryptographic techniques, delving into their mathematical foundations, practical implementations, and their significance in the contemporary landscape of information security. The paper provides an in-depth analysis of latticebased cryptographic protocols, including encryption schemes, digital signatures, and key exchange mechanisms. Emphasizing the post-quantum safety and impenetrability of latticebased cryptography, the research investigates the theoretical underpinnings of lattice problems and their computational complexity.

show abstract

Section: A Lattice Based Encryption Algorithmsmentioning

confidence: 99%

Section: A Resource Utilizationmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Implementation of lattice based Cryptograpy cyber forensic system

Kumari,

Anand,

Sharma

et al. 2024

Preprint

View full text Add to dashboard Cite

show abstract

“…A 64 bit block cipher MISTY1 is an ISO standardized algorithm designed by Mitsubishi Corporation Electric Limited. It is used to handle a 64 bit block of data or less, e.g., 8 byte personal identification numbers (PINs), and is based on a provable 2 −56 probability against linear/differential cryptanalysis [7][8][9][10].…”

Section: Introductionmentioning

confidence: 99%

Design Space Exploration for High-Speed Implementation of the MISTY1 Block Cipher

Hasan

Khizar

Mahmood

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper proposes 2 × unrolled high-speed architectures of the MISTY1 block cipher for wireless applications including sensor networks and image encryption. Design space exploration is carried out for 8-round MISTY1 utilizing dual-edge trigger (DET) and single-edge trigger (SET) pipelines to analyze the tradeoff w.r.t. speed/area. The design is primarily based on the optimized implementation of lookup tables (LUTs) for MISTY1 and its core transformation functions. The LUTs are designed by logically formulating S9/S7 s-boxes and FI and {FO + 32-bit XOR} functions with the fine placement of pipelines. Highly efficient and high-speed MISTY1 architectures are thus obtained and implemented on the field-programmable gate array (FPGA), Virtex-7, XC7VX690T. The high-speed/very high-speed MISTY1 architectures acquire throughput values of 25.2/43 Gbps covering an area of 1331/1509 CLB slices, respectively. The proposed MISTY1 architecture outperforms all previous MISTY1 implementations indicating high speed with low area achieving high efficiency value. The proposed architecture had higher efficiency values than the existing AES and Camellia architectures. This signifies the optimizations made for proposed high-speed MISTY1 architectures.

show abstract