NCCS Crypto Corner

The program aims to facilitate final year undergraduate/ MS Thesis students of higher education institutions by providing them financial assistance for developing prototypes / working models of their Final Year Projects (FYP) related to Cryptography in order to increase creativity, innovation and hands on engineering and development skills.
There are multiple project ideas Rs. 100,000 of funding will be granted for each idea.

• Study and implementation of linear cryptanalysis in view of a tutorial by M.Heys Memorisl university of Newfoundland.
• Study and implementation of differential cryptanalysis in view of a tutorial by M.Heys Memorisl university of Newfoundland.
• Implementation of Differential cryptanalysis of 3 round DES.
• Generation and analysis of S-boxes of different order in Galois Field.
• Homomorphic Encryption: Secure Telling and other processes.
• Tamper proof, secure and reliable block chain.
• Construction of Boolean function of degree 10.
• Mathematical structures of S-Boxes.
• Diehard cipher testing suite for block ciphers.
• New directions in QKD (Algorithmic level)
• Comparison of NIST finalized post quantum secure key establishment algorithms.
• Comparison of NIST finalized post quantum secure digital signatures algorithms.
• Implementation of ECC for different application.

• Smart card and Post Quantum Cryptography.
• Implementation of PQC on embedded devices in the IoT.
• Threshold cryptography implementation for software applications.
Mathematical Cryptanalysis
• Exploring the Impact of Quantum Computing on Linear / Differential Cryptanalysis: Investigate and demonstrate in quantum frameworks (Cirq, Qiskit, ProjectQ or Google TFQ) how quantum computing could potentially enhance cryptanalysis techniques.
• Implementing Linear / Differential Cryptanalysis on Lightweight Block Ciphers: Apply linear cryptanalysis techniques to NIST standardized and other widely used lightweight block ciphers and evaluate their effectiveness.
• Enhancing the Efficiency of Linear / Differential Cryptanalysis with Machine Learning Techniques: Explore how machine learning techniques can be used to improve the efficiency of trails and discovery of new functional relations
• Study the effectiveness of linear / differential cryptanalysis when cipher is only accessible behind a practical encryption scheme (i.e., mode of encryption applied to the output)
• Development of design strategy that provides provable security bounds for non-SPN ciphers, similar to wide-trail strategy
• Implementing a Real-time Cryptanalysis Tool for Detecting Linear Patterns in Network Traffic to locate weak points in continuous streams of encrypted data in widely used secure communication and storage protocols

Non-linearity Design in Ciphers
• Optimization of S-Boxes using Machine Learning: Explore the use of machine learning algorithms to optimize the generation and analysis of S-Boxes
• Low-latency masking for S-Boxes: Investigate the concept of low-latency masking for S-Boxes and its implications for lightweight cryptography.
• S-Box Representations and Algebraic Attacks: Study different S-Box representations and their effect on the complexity of algebraic attacks.
• S-Box Design for Increased Cryptanalysis Resistance: Research the design criteria of S-Boxes that increase resistance against cryptanalysis for a general NxM mapping for all three cases N > M, N = M, and N < M.
• Exploration of Large S-Box Sizes: Go beyond conventional small (and even) S-Box sizes and explore the implications and implementation options of larger sizes (with 10 – 32 bit width)
• Systematic Search for New S-Box Designs using AI / Deep-learning Models: Conduct a systematic search for new S-Box designs that take implementation properties into account from the start. This is particularly applicable when exploring large sized S-boxes
• Efficient Implementations for S-Boxes: Look into efficient implementations of inverse S-Boxes and the possibility for it to share resources with the forward S-Box in both CPU and FPGA architectures
• Explore and develop the theory of state-full s-boxes both from security and efficiency perspective; state-full s-box intuitively are supposed to be better than static s-boxes, but one needs to investigate the limits and efficiency gains
• S-Boxes in Lightweight Cryptography: Research the role and optimization of S-Boxes in lightweight cryptography, particularly in the context of Tactical Radios and NIST Lightweight Cryptography competition.

Secure Private Cloudss
• Homomorphic Encryption for Secure Healthcare Data Processing: Develop an efficient PoC system that uses existing proposals of homomorphic encryption to securely process healthcare data in the commercial clouds (AWS, etc.).
• Secure Multi-Party Computation (MPC) for Machine Learning: Implement a system that uses MPC to train machine learning models on private datasets owned by different parties.
• Homomorphic Encryption in Blockchain: Integrate homomorphic encryption into a blockchain platform like Hyperledger Fabric (or similar) to protect the privacy of transaction data
• Secure Computation using Semi-Trusted Clouds: Design and implement a private cloud layer using cryptographic techniques to protect data and computation on semi-trusted external clouds (AWS, Azure, etc).
• Data Confidentiality and Secure Computation using multi-cloud architecture: Design a complete PoC to achieve data confidentiality in cloud storage using MPC and homomorphic encryption by spreading data and computation across multiple cloud provides, which may include private clouds.
• Homomorphic Encryption for Privacy-Preserving Analytics: Implement a secure Database System that uses homomorphic encryption for privacy-preserving analytics.
• MPC for Secure Image / video Processing: Develop an application that uses MPC to perform secure image / video processing tasks.

Block chains and HSMs
• Quantum-Resistant Blockchain: Develop a blockchain system that is resistant to quantum computing attacks but is also efficient enough for practical use-cases
• Blockchain 4.0: Explore the potential of Blockchain 4.0, focusing on improving speed, user experience, and usability
• Hardware Security Module for Cloud: Investigate and implement PoC with the use of HSMs and private cloud environments to enhance data security
• Post-Quantum Cryptography in HSMs: Implement PoC for post-quantum cryptographic algorithms in HSMs to prepare for the advent of quantum computers
• Secure Execution Environments in HSMs: Develop CPU / FPGA based secure execution environments within HSMs for running sensitive applications.
• Secure Multi-party Computation with HSM: Investigate and implement PoC with the use of HSMs in achieving secure multi-party computation protocols to enhance security and performance.
• HSMs for Secure Software Updates: Develop a system for secure software updates using HSMs to ensure the integrity and authenticity of the updates.
• HSMs for Secure Machine Learning Models: Protect machine learning models using HSMs to ensure the confidentiality and integrity of the models when used in untrusted environments
• HSMs and Blockchain for Robust Key Management System: Use HSMs and Blockchains for managing and distributing cryptographic keys in critical infrastructure
• Framework for Secure Android Applications using private HSMs: Build framework and PoC to protect confidentiality and computation of user data on untrusted Android platforms using external private HSMs



Niche Applications
• Advanced Threshold Cryptography: Explore and implement the use of multi-party threshold cryptography in secure distribution of trust
• Zero-Knowledge Authentication mutual authentication and key establishment: Investigate and implement the cross-platform software framework of zero-knowledge authentication in privacy-preserving manner in critical infrastructures
• Multi-User Security Authenticated Encryption from Tweakable Block Ciphers: Study and propose the multi-user security of nonce-based authentication encryption schemes based on existing or proposed tweakable block ciphers.
• Secure and Lightweight Authentication and Key-Sharing Scheme for Large User Group and Wireless Sensor Network: This including proposing, analyzing and developing a PoC for a secure and lightweight authentication and key-sharing and distribution scheme.
• Quantum Time/Memory/Data Tradeoff Attacks: Analyze the quantum time/memory/data tradeoff attacks and their implications on security. The proposal will be based on deeper understanding of quantum information theory and algorithm development.
• Fair Multi-Secret Sharing Scheme Based on Asymmetric Bivariate Polynomial: Propose a fair multi-secret sharing scheme based on asymmetric bivariate polynomial.
• Analog Signal Encryption with Quantum Computing: Research the potential of quantum computing in analog signal encryption. The proposal will be based on deeper understanding of quantum information theory and algorithm development.
• Advanced Scrambling Techniques for Software and Information Security: Investigate advanced scrambling techniques for enhancing SW / information security against reverse engineering.
• Post-Quantum Threshold Cryptography: Research the impact of quantum computing on threshold cryptography and develop post-quantum secure schemes.
• Zero-Knowledge Proofs in Blockchain: Investigate the application of zero-knowledge proofs in enhancing privacy and security in blockchain technology.
• Tweakable Encryption for Secure Cloud Storage: Develop a tweakable encryption scheme for secure data storage in cloud environments.
• Provable Scrambling Techniques for Digital Watermarking: Investigate scrambling techniques that can be used to enhance the security of digital watermarking systems with provable security guarantees
• Steganography and Information Hiding in multiple digital Images: Study techniques for hiding information within digital images, with a focus on robustness against image manipulation, image deletion, and compression.
• Secure Blockchain Voting System: Develop a secure voting protocol and system for a trusted third-party (Federal Election Commission), who owns and maintain custom blockchain technology to ensure transparency, integrity in elections.
• General purpose and transparent Homomorphic Encryption library for Cloud Computing: Implement homomorphic encryption techniques to enable secure computation on encrypted data in cloud computing environments.
• Quantum Key Distribution (QKD) using inexpensive COTS hardware: Investigate and implement quantum key distribution protocols for secure key exchange between two parties using inexpensive and general purpose hardware and software components.
• Biometric Cryptosystems: Develop cryptographic systems that use biometric data (e.g., fingerprints, iris scans) for secure authentication and key generation with resistance of variation of sensor output, aging, and noise.
• Privacy-Preserving Machine Learning Frameworks: Design privacy-preserving machine learning algorithms that allow data training and analysis without compromising the privacy of individual user data.
• Secure Whitebox Hardware Implementation of Cryptographic Algorithms: Implement cryptographic algorithms on hardware platforms (FPGA / CPU / GPU) with built-in white-gox security features to protect against reverse-engineering and side-channel attacks.

Applied Mathematics for Cryptology
• Design and Analysis of Boolean Functions of Higher Degree: Investigate the construction and properties of Boolean functions of degree greater than 10 and their applications in cryptography.
• Blockchain 4.0: Explore the potential of Blockchain 4.0, focusing on improving speed, user experience, and usability
• Non-associative Algebraic Structures in Cryptography: Explore the applications of non-associative algebraic structures for the construction of linearly optimal codes and cryptosystems
• Algebraic Attacks on AES: Examine algebraic attacks on the Advanced Encryption Standard (AES), including the problem of solving systems of multivariate quadratic equations over arbitrary fields
• Abstract Cryptographic Algorithms on Groups and Algebras: Study abstract cryptographic algorithms based on groups and algebras, with a focus on their security aspects. This allows to use any underlying selection of algebraic structure for concrete implementation without compromise on security guarantees.
• Randomness Test Technologies for Cryptographic Algorithms: Analyze various randomness test technologies for cryptographic algorithms and compare their effectiveness, including NIST STS and modern Machine Learning based distinguishers
• Pseudorandom Function (PRF) Construction in Cryptography: Explore and propose a number of direct PRF constructions the construction of pseudorandom functions and provide detail comparisons with traditional block ciphers based design in terms of security and efficiency.
• Comparative quantities analysis of Feistel-type, SPN-type, Sponge-type, and LWC-type constructions in Cryptography with comparison in terms of provable guarantees in light of traditional and modern AI based cryptanalysis
• New Modes of Encryption for Radio Communication Environment: Investigate hybrid encryption and modes with their security aspects that works better than standard NIST modes to provide increased security and implementation advantages for radio devices under typical channel models
• Signature Schemes in the Random Oracle Model: Explore signature schemes in the random oracle model, including their construction and security analysis
• Self-synchronizing stream Ciphers and Boolean Functions: Investigate the use of Boolean functions in self-synchronizing stream ciphers to enhance security (confidentiality, authentication, availability) in resource constrained devices
• Affine Equivalent Boolean Functions for Cryptography: Analyze and build tools to discover affine equivalent Boolean functions and models with their applications in cryptography
• Shannon Entropy-Based Randomness Measurement for Live Stream of Data: Develop Shannon entropy-based randomness measurements for digital data such as audio, video and IP streams, considering its applications as part of high throughput firewalls



Quantum Computing
• Quantitative estimation of security of new protocols in QKD: Investigate and development security analysis techniques for new protocols in Quantum Key Distribution (QKD) that claim to enhance security and efficiency beyond what is achievable with classic techniques
• Performance Analysis of NIST Post-Quantum Key Establishment Algorithms: Compare the performance of the post-quantum key establishment algorithms finalized by NIST in terms of computational efficiency, key size, and security
• Security Assessment of NIST Post-Quantum Digital Signature Algorithms: Evaluate the security of the post-quantum digital signature algorithms selected by NIST against various attack scenarios
• Smart Cards / IoT and Post-Quantum Cryptography: Study and implementation of the integration of post-quantum cryptographic algorithms into smart cards / IoT and assess their performance and security
• Hybrid Quantum Key Distribution Systems: Research on the design and implementation of hybrid QKD systems that combine classical and quantum cryptographic techniques for enhanced security
• Efficient Implementation of Post-Quantum Cryptography on Embedded Systems: Study how to optimize the implementation of post-quantum cryptographic algorithms on embedded systems for efficient performance, specifically in ARM, RISC, and Zynq-based platforms
• Hardware-based Post-Quantum Cryptography: Research on hardware-based implementations of post-quantum cryptographic algorithms and their advantages over software-based implementations. The hardware refers to FPGA and bare-metal GPU implementations, or some smart combination of both.
• Post-Quantum Cryptography for Secure Mobile Communications: Investigate how post-quantum cryptography can be used to secure mobile communications against quantum attacks.
• Post-Quantum Cryptography in Cyber Physical Systems (CPS): Explore the application of post-quantum cryptography in securing cyber physical systems, such as smart grids
• Post-Quantum Cryptography for Secure Software Development: Investigate build PoC using post-quantum cryptographic algorithms that can be integrated into software development processes to enhance software security of DevSecOps, Software Licensing, and Secure Update.

• • All Higher Education Institutions recognized by HEC are eligible to participate in the Program.
• • Nomination of focal person in mandatory requirement for participation in NCCS Crypto Corner. Eligible Institutions need to fill nomination section of form for participation. Interested Students will have to submit consent form during registration duly signed by focal person of their university.
• • Students must be studying in final year (4th academic year) of their undergraduate degree program or MS Program (Thesis) of the institutions.
• • Student must be relevant to IT or crypto related domains
• • Application of FYP can only be submitted via NCCS crypto corner registration portal.