Conferences related to Decryption

Back to Top

ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 IEEE International Conference on Consumer Electronics (ICCE)

The International Conference on Consumer Electronics (ICCE) is soliciting technical papersfor oral and poster presentation at ICCE 2018. ICCE has a strong conference history coupledwith a tradition of attracting leading authors and delegates from around the world.Papers reporting new developments in all areas of consumer electronics are invited. Topics around the major theme will be the content ofspecial sessions and tutorials.


GLOBECOM 2020 - 2020 IEEE Global Communications Conference

IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.


2020 IEEE International Symposium on Circuits and Systems (ISCAS)

The International Symposium on Circuits and Systems (ISCAS) is the flagship conference of the IEEE Circuits and Systems (CAS) Society and the world’s premier networking and exchange forum for researchers in the highly active fields of theory, design and implementation of circuits and systems. ISCAS2020 focuses on the deployment of CASS knowledge towards Society Grand Challenges and highlights the strong foundation in methodology and the integration of multidisciplinary approaches which are the distinctive features of CAS contributions. The worldwide CAS community is exploiting such CASS knowledge to change the way in which devices and circuits are understood, optimized, and leveraged in a variety of systems and applications.


2020 59th IEEE Conference on Decision and Control (CDC)

The CDC is the premier conference dedicated to the advancement of the theory and practice of systems and control. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.



Periodicals related to Decryption

Back to Top

Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Computer

Computer, the flagship publication of the IEEE Computer Society, publishes peer-reviewed technical content that covers all aspects of computer science, computer engineering, technology, and applications. Computer is a resource that practitioners, researchers, and managers can rely on to provide timely information about current research developments, trends, best practices, and changes in the profession.


Dependable and Secure Computing, IEEE Transactions on

The purpose of TDSC is to publish papers in dependability and security, including the joint consideration of these issues and their interplay with system performance. These areas include but are not limited to: System Design: architecture for secure and fault-tolerant systems; trusted/survivable computing; intrusion and error tolerance, detection and recovery; fault- and intrusion-tolerant middleware; firewall and network technologies; system management ...


Embedded Systems Letters, IEEE

EEE Embedded Systems Letters seeks to provide a forum of quick dissemination of research results in the domain of embedded systems with a target turn-around time of no more than three months. The journal is currently published quarterly consisting of new, short and critically refereed technical papers. Submissions are welcome on any topic in the broad area of embedded systems ...


Information Forensics and Security, IEEE Transactions on

Research on the fundamental contributions and the mathematics behind information forensics, information seurity, surveillance, and systems applications that incorporate these features.



Most published Xplore authors for Decryption

Back to Top

Xplore Articles related to Decryption

Back to Top

Fast decryption utilizing correlation calculation for BSS-based speech encryption system

2010 Sixth International Conference on Natural Computation, 2010

Original BSS (blind source separation)-based speech encryption system utilizes BSS to perform decryption, but the complexity of BSS algorithms limits the decryption speed and its real-time application. Correlation calculation is an algebraic decryption method originally proposed for BSS-based image cryptosystem to overcome two limitations of BSS: permutation and scaling ambiguity and difficulty for separating strongly correlated images. Considering that there ...


Speed up RSA’s Decryption Process with Large sub Exponents using Improved CRT

2018 International Conference on Information Technology (InCIT), 2018

The aim of this paper is to present the improvement of Chinese Remainder Theorem (CRT) to speed up RSA's decryption process by changing sub exponents and transforming ciphertext in another domain. Although applying CRT with RSA, called CRT-RSA, can be chosen to decrease time in decryption side, computing modular exponentiation still consumes enormous time whenever sub exponents are large. In ...


Energy Consumption Cost Analysis of Mobile Data Encryption and Decryption

2016 IEEE International Conference on Mobile Services (MS), 2016

Some enterprises, especially healthcare, require high level of security to protect both user and corporate privacy when consuming services on the mobile device. Thus, encryption-decryption methodologies have been employed over the years to secure the data in distributed mobile architectures. The concern that has been gravely ignored is the energy consumption cost of data encryption- decryption on battery-powered devices such ...


Low latency for file encryption and decryption using BRA algorithm in network security

2015 International Conference on Pervasive Computing (ICPC), 2015

Information security is major obstacle in different areas like military, network application, bank application. File is forward from one location to another location in the network. Many hackers are illegally access the information. To provide solution to this problem many authors has introduced different algorithms and techniques. The different algorithms like AES, DES and triple DES achieve more security but ...


Memristor-Based Chaotic Circuit for Text/Image Encryption and Decryption

2015 8th International Symposium on Computational Intelligence and Design (ISCID), 2015

In this paper, a novel application research on memristor is studied, and memristor-based chaotic circuit for text, image encryption and decryption is presented. In light of memristor characteristic, nonlinear circuit and chaotic cryptography, a new cryptosystem model of memristor-based chaotic circuit is designed. Then, text, image encryption and decryption are represented. Simulation results verify the feasibility and the practicability of ...



Educational Resources on Decryption

Back to Top

IEEE-USA E-Books

  • Fast decryption utilizing correlation calculation for BSS-based speech encryption system

    Original BSS (blind source separation)-based speech encryption system utilizes BSS to perform decryption, but the complexity of BSS algorithms limits the decryption speed and its real-time application. Correlation calculation is an algebraic decryption method originally proposed for BSS-based image cryptosystem to overcome two limitations of BSS: permutation and scaling ambiguity and difficulty for separating strongly correlated images. Considering that there is similarity between encryption matrix for speech encryption and image encryption, this paper analyzes the correlation of speech signals with key signals, and then utilizes the correlation calculation to achieve speech decryption. The experiment results show that correlation calculation decryption nicely simplifies BSS-based speech encryption system, largely speeds up the speech decryption, and slightly improves the quality of decrypted speech signals.

  • Speed up RSA’s Decryption Process with Large sub Exponents using Improved CRT

    The aim of this paper is to present the improvement of Chinese Remainder Theorem (CRT) to speed up RSA's decryption process by changing sub exponents and transforming ciphertext in another domain. Although applying CRT with RSA, called CRT-RSA, can be chosen to decrease time in decryption side, computing modular exponentiation still consumes enormous time whenever sub exponents are large. In addition, the proposed method suits to apply with high sub exponents of CRT-RSA because the new sub exponents are smaller. On the other hand, both of them become larger when CRT-RSA's exponents are small. Therefore, the proposed method cannot be chosen to replace CRT-RSA but it is one of two choices for the implementation. If sub exponents are small, CRTRSA is a better choice to speed up RSA's decryption. Nevertheless, the proposed method should be selected when sub exponents are large. The experimental results show that the proposed method can finish the process faster than CRT-RSA for both of key generation process and decryption process whenever sub exponents are large. Furthermore, in decryption side, the proposed method is faster than CRT-RSA about 20 - 40%.

  • Energy Consumption Cost Analysis of Mobile Data Encryption and Decryption

    Some enterprises, especially healthcare, require high level of security to protect both user and corporate privacy when consuming services on the mobile device. Thus, encryption-decryption methodologies have been employed over the years to secure the data in distributed mobile architectures. The concern that has been gravely ignored is the energy consumption cost of data encryption- decryption on battery-powered devices such as smartphones and tablets. In this work, we studied the energy consumption patterns of multiple encryption- decryption methodologies (including RSA, DES, and AES) in securing the electronic health records and argue that some methodologies do consume power more than others.

  • Low latency for file encryption and decryption using BRA algorithm in network security

    Information security is major obstacle in different areas like military, network application, bank application. File is forward from one location to another location in the network. Many hackers are illegally access the information. To provide solution to this problem many authors has introduced different algorithms and techniques. The different algorithms like AES, DES and triple DES achieve more security but it takes more time for encryption and decryption files. These algorithm increases the complexity of the algorithm. In our algorithm we have investigate parameters of network security. This algorithm provides more security and takes smallest amount of time for file encryption and decryption. This algorithm can apply on different types of files like text, image, audio, video files. In the Byte Rotation Algorithm involve two techniques. One is random key generation technique is used. And second is parallel encryption and decryption is process using multithreading technique. Key size of random key generation technique is 128 bit.128 bit random key generation is difficult for crack to attacker.

  • Memristor-Based Chaotic Circuit for Text/Image Encryption and Decryption

    In this paper, a novel application research on memristor is studied, and memristor-based chaotic circuit for text, image encryption and decryption is presented. In light of memristor characteristic, nonlinear circuit and chaotic cryptography, a new cryptosystem model of memristor-based chaotic circuit is designed. Then, text, image encryption and decryption are represented. Simulation results verify the feasibility and the practicability of memristor- based chaotic circuit for encryption and decryption.

  • Public Verifiable Threshold Decryption Scheme without Trusted Center

    The paper proposes a publicly verifiable threshold decryption scheme with no center based on the situation that a trust center does not exist in many special occasions. The scheme asks decryption member for submitting commitment in the decryption process in order to make sure the identity is publicly verifiable. Moreover, the scheme has several advantages such as protecting the shadow without revealing and the members can be deleted dynamically.

  • Study on NTRU Decryption Failures

    NTRU is a new public key encryption scheme based on hard problems in lattice. Due to the linear operations, both encryption and decryption of NTRU are very fast. However, decryption of this scheme may be failed even for recommended parameters. In this paper, NTRU decryption failures are analyzed. As a result, the theoretical bound of parameters is presented, which guaranteed NTRU decryption failure free. In order to correct NTRU decryption failures, we designed a compensating algorithm. To our knowledge, this algorithm is better than any other ones for NTRU decryption failure correction. An example is given at the end of this paper

  • Intelligent Transparent Encryption-Decryption as Security-as-a-Service from clouds

    Security-as-a-Service model delivers security as a commodity in form of a cloud service. The security is provided as one of cloud services in place of on-premise security solutions. The initiative proposed here is to provide encryption and decryption as a cloud service in an intelligent and transparent manner. The users can exercise the service by simply using a Web browser. The algorithm is intelligent in a way by classifying the Encryption process into multiple Encryption levels. The levels are classified as per the protection level needed by the user. The levels described here are low, high and custom. A proof of concept (POC) prototype is implemented for Encryption and Decryption as-a-Service from the cloud. A selective range of algorithms are used in the prototype which are appropriate at the specified three levels of classification. The secret key for encryption/ decryption is generated from user's passphrase by using a suitable and proper methodology. The encryption and decryption is done at file level. The objective is also to make the process of Encryption/ Decryption transparent to the user application. The Encryption-Decryption as a Service (ENCaaS) implemented as the cloud service can provide the user with all the advantages offered by Security-as-a-Service (SECaaS). The freshness in the approach is that the POC is integrated with other Security-as-a-Service options to provide a portal through which various security services can be provided. The ENCaaS will help to protect the data in cloud throughout life cycle from data being at rest, data in transit to data in use. The POC of ENCaaS is implemented and it is evaluated using suitable criterions successfully.

  • Mathematical optimization of decrypting algorithm for soft input decryption

    In this work, the strategy for correction of bits using Soft Input Decryption is analyzed. Soft Input Decryption is used for correction of cryptographic check values, which are very fragile when they are transmitted over noisy channels: only one wrong bit at input of the decryptor causes about 50% of errors at output of the decryptor. Soft Input Decryption corrects incorrect bits of cryptographic check values in most of cases using combination of SISO channel decoding and decrypting. Soft Input Decryption is an iterative process and therefore it is needed to minimize duration of iterations. This paper suggests an algorithm for optimization of Soft Input Decryption, which enables restriction of needed computing time of the Soft Input Decryption algorithm. Suggested optimization is performed for ECDSA digital signatures.

  • Revisiting Attribute-Based Encryption With Verifiable Outsourced Decryption

    Attribute-based encryption (ABE) is a promising technique for fine-grained access control of encrypted data in a cloud storage, however, decryption involved in the ABEs is usually too expensive for resource-constrained front- end users, which greatly hinders its practical popularity. In order to reduce the decryption overhead for a user to recover the plaintext, Green et al. suggested to outsource the majority of the decryption work without revealing actually data or private keys. To ensure the third-party service honestly computes the outsourced work, Lai et al. provided a requirement of verifiability to the decryption of ABE, but their scheme doubled the size of the underlying ABE ciphertext and the computation costs. Roughly speaking, their main idea is to use a parallel encryption technique, while one of the encryption components is used for the verification purpose. Hence, the bandwidth and the computation cost are doubled. In this paper, we investigate the same problem. In particular, we propose a more efficient and generic construction of ABE with verifiable outsourced decryption based on an attribute-based key encapsulation mechanism, a symmetric-key encryption scheme and a commitment scheme. Then, we prove the security and the verification soundness of our constructed ABE scheme in the standard model. Finally, we instantiate our scheme with concrete building blocks. Compared with Lai et al.'s scheme, our scheme reduces the bandwidth and the computation costs almost by half.



Standards related to Decryption

Back to Top

(Replaced) IEEE Standard VHDL Language Reference Manual

his standard revises and enhances the VHDL language reference manual (LRM) by including a standard C language interface specification; specifications from previously separate, but related, standards IEEE Std 1164 -1993,1 IEEE Std 1076.2 -1996, and IEEE Std 1076.3-1997; and general language enhancements in the areas of design and verification of electronic systems.