-->

ABOUT US

Our development agency is committed to providing you the best service.

OUR TEAM

The awesome people behind our brand ... and their life motto.

  • Kumar Atul Jaiswal

    Ethical Hacker

    Hacking is a Speed of Innovation And Technology with Romance.

  • Kumar Atul Jaiswal

    CEO Of Hacking Truth

    Loopholes are every major Security,Just need to Understand it well.

  • Kumar Atul Jaiswal

    Web Developer

    Techonology is the best way to Change Everything, like Mindset Goal.

OUR SKILLS

We pride ourselves with strong, flexible and top notch skills.

Marketing

Development 90%
Design 80%
Marketing 70%

Websites

Development 90%
Design 80%
Marketing 70%

PR

Development 90%
Design 80%
Marketing 70%

ACHIEVEMENTS

We help our clients integrate, analyze, and use their data to improve their business.

150

GREAT PROJECTS

300

HAPPY CLIENTS

650

COFFEES DRUNK

1568

FACEBOOK LIKES

STRATEGY & CREATIVITY

Phasellus iaculis dolor nec urna nullam. Vivamus mattis blandit porttitor nullam.

PORTFOLIO

We pride ourselves on bringing a fresh perspective and effective marketing to each project.

  • brute-force attack in python

     

    brute-force attack in python



    In a brute-force attack, the advisory attempts to decrypt the ciphertext by using every possible key. If the key is small enough, a brute-force attack can be successful in a matter of minutes. In fact, if the keys are around 222, we can write a Python script to crack the password utilizing brute force. For your estimation purposes, when it comes to brute-force attacks, the following helps you ballpark
    the amount of security you get for various size problems:


    • A key space/message space of 264 is enough for a couple hours of security.
    • A key space/message space of 2128 is enough for several decades of pre- quantum security.
    • A key space/message space of 2256 is enough for several decades of post- quantum security.




    The following is an example of code that will generate a four-digit PIN and then loop through the iterations using brute force to determine the password:



    ┌──(hackerboy㉿KumarAtulJaiswal)-[~/Desktop/implementing-cryptography/cert]
    └─$ cat brute-crypt.py     
    #!/usr/bin/python3
    
    import random
    generated_password = str(random.randint(0, 9999))
    #print(generated_password)
    
    for i in range(10000):
        Trial = str(i)
        if Trial == generated_password:
           print('Found password: ' + generated_password)
                                                                                                                                                                            
    ┌──(hackerboy㉿KumarAtulJaiswal)-[~/Desktop/implementing-cryptography/cert]
    └─$ 
    
    



    brute-force attack in python



    ┌──(hackerboy㉿KumarAtulJaiswal)-[~/Desktop/implementing-cryptography/cert]
    └─$ 
                                                                                                                                                                            
    ┌──(hackerboy㉿KumarAtulJaiswal)-[~/Desktop/implementing-cryptography/cert]
    └─$ python3 brute-crypt.py 
    Found password: 8737
                                                                                                                                                                            
    ┌──(hackerboy㉿KumarAtulJaiswal)-[~/Desktop/implementing-cryptography/cert]
    └─$ python3 brute-crypt.py
    Found password: 6227
                                                                                                                                                                            
    ┌──(hackerboy㉿KumarAtulJaiswal)-[~/Desktop/implementing-cryptography/cert]
    └─$ python3 brute-crypt.py
    Found password: 433
                                                                                                                                                                            
    ┌──(hackerboy㉿KumarAtulJaiswal)-[~/Desktop/implementing-cryptography/cert]
    └─$ 
    
    
    



    Disclaimer

     

    All tutorials are for informational and educational purposes only and have been made using our own routers, servers, websites and other vulnerable free resources. we do not contain any illegal activity. We believe that ethical hacking, information security and cyber security should be familiar subjects to anyone using digital information and computers. Hacking Truth is against misuse of the information and we strongly suggest against it. Please regard the word hacking as ethical hacking or penetration testing every time this word is used. We do not promote, encourage, support or excite any illegal activity or hacking.

     

  • Basics features of java

     


     

     

    Basics features of java



    # Java is simple
    # Java is secure
    # Java is portable
    # Java is object-oriented
    # Java is robust
    # Java is multithreaded
    # Java is architecture-neutral
    # Java is interpreted
    #
    Java’s performance
    # Java is distributed
    # Java is dynamic




    Java is simple


    Java is Easy to write and more readable and eye catching.
    Java has a concise, cohesive set of features that makes it easy to learn and use.
    Most of the concepts are drew from C++ thus making Java learning simpler.




    Java is secure


    Java program cannot harm other system thus making it secure.
    Java provides a secure means of creating Internet applications.
    Java provides secure way to access web applications.



    Java is portable


    Java programs can execute in any environment for which there is a Java run-time system.
    (JVM) Java programs can be run on any platform (Linux,Window,Mac) Java programs can be transferred over world wide web (e.g applets)




    Java is object-oriented


    Java programming is object-oriented programming language.
    Like C++ java provides most of the object oriented features.
    Java is pure OOP. Language. (while C++ is semi object oriented)




    Java is robust


    Java encourages error-free programming by being strictly typed and performing run-time checks.



    Java is multithreaded


    Java provides integrated support for multithreaded programming.



    Java is architecture-neutral


    Java is not tied to a specific machine or operating system architecture.
    Machine Independent i.e Java is independent of hardware .



    Java is interpreted


    Java supports cross-platform code through the use of Java bytecode.
    Bytecode can be interpreted on any platform by JVM.




    Java’s performance


    Bytecodes are highly optimized.
    JVM can executed them much faster



    Java is distributed


    Java was designed with the distributed environment.
    Java can be transmit,run over internet.



    Java is dynamic


    Java programs carry with them substantial amounts of run-time type information that is used to verify and resolve accesses
    to objects at run time.



    Disclaimer

     

    All tutorials are for informational and educational purposes only and have been made using our own routers, servers, websites and other vulnerable free resources. we do not contain any illegal activity. We believe that ethical hacking, information security and cyber security should be familiar subjects to anyone using digital information and computers. Hacking Truth is against misuse of the information and we strongly suggest against it. Please regard the word hacking as ethical hacking or penetration testing every time this word is used. We do not promote, encourage, support or excite any illegal activity or hacking.

     

  • Exceptions in Java

     

    Exceptions in Java

     

    Introduction


    Customers have high expectations for the code we produce.

    Users will use our programs in unexpected ways.

    Due to design errors or coding errors, our programs may fail in unexpected ways during execution.

    It is our responsibility to produce quality code that does not fail unexpectedly.

    Consequently, we must design error handling into our programs. 

     

    Errors and Error handling


    An Error is any unexpected result obtained from a program during execution.

    Unhandled errors may manifest themselves as incorrect results or behavior, or as abnormal program termination.

    Errors should be handled by the programmer, to prevent them from reaching the user.


    Memory errors (i.e memory incorrectly allocated, memory leaks…)

    File system errors (i.e. disk is full…)

    Network errors (i.e. network is down…)

    Calculation errors (i.e. divide by 0)

    Array errors (i.e. accessing element –1)




    Types of Exceptions


    Unchecked Exceptions

    Checked Exceptions It is not required that these types Must either be caught by a of exceptions be caught or method or declared in
    its declared on a method. signature.


    Runtime exceptions can be

    Placing exceptions in the generated by methods or by method signature harkens the JVM itself.

    Errors are generated from deep within the JVM.


    Keywords


    • throws Describes the exceptions which can be raised by a method.
    • throw Raises an exception to the first available handler in the call stack, unwinding the stack along the way.
    • try Marks the start of a block associated with a set of exception handlers.
    • catch If the block enclosed by the try generates an exception of this type, control moves here; watch out for implicit subsumption.
    • finally Always called when the try block concludes, and after any necessary catch handler is complete.



    There are two types of errors:


    Compile time errors
    Runtime error



    Compile time errors

    Instead of declaring int a; you mistakenly declared it as in a; for which compiler will throw an error.



    Runtime Errors Example

    A Runtime error is called an Exceptions error. It is any event that interrupts the normal flow of program execution.

    Example for exceptions are, arithmetic exception, Nullpointer exception, Divide by zero exception, etc.



    class JavaException {
       public static void main(String args[]){
          int d = 0;
          int n = 20;
          int fraction = n/d;
         System.out.println("End Of Main");
       }
    



     

     

    Disclaimer

     

    All tutorials are for informational and educational purposes only and have been made using our own routers, servers, websites and other vulnerable free resources. we do not contain any illegal activity. We believe that ethical hacking, information security and cyber security should be familiar subjects to anyone using digital information and computers. Hacking Truth is against misuse of the information and we strongly suggest against it. Please regard the word hacking as ethical hacking or penetration testing every time this word is used. We do not promote, encourage, support or excite any illegal activity or hacking.

     

     

  • Pipelining in Computer Architecture

     

    Pipelining in Computer Architecture



    Parallel Processing


    A Parallel Processing system is able to perform concurrent data processing to achieve faster execution time.

    Example: While an instruction is being executed in the ALU, the next instruction can be read from memory.

    The system may have two or more ALUs and be able to execute two or more instructions at the same time. “So the purpose of
    parallel processing is to speedup the computer processing capabilities.”


    Pipelining Case: Laundry


    4 loads of laundry that need to washed, dried, and folded.

    – 30 minutes to wash, 40 min. to dry, and 20 min. to fold.
    – We have 1 washer, 1 dryer, and 1 folding station.


    What’s the most efficient way to get the 4 loads of laundry done?

     

     

    Pipelining in Computer Architecture

     

     


    Non Pipelined Laundry • Takes a total of 6 hours; nothing is done in parallel


    Pipelined Laundry • Using this method, the laundry would be done at 9:30.

     

     

    Pipelining in Computer Architecture




    Definition 

    Pipelining is an speed up technique where multiple instructions are overlapped in execution on a processor.


    Processors


    Computers, like laundry, typically perform the exact same steps for every  instruction:–


    • Fetch an instruction from memory
    • Decode the instruction
    • Execute the instruction
    • Read memory to get input
    • Write the result back to memory




    Instruction Pipeline



    Instruction execution process lends itself naturally to pipelining
    overlap the subtasks of instruction fetch, decode and execute

    • Fetch instruction (FI)
    • Decode instruction (DI)
    • Calculate operands (CO)
    • Fetch operands (FO)
    • Execute instructions (EI)
    • Write result (WR) Overlap these operations



    Instruction pipeline has six operations



    Instructions Fetch • The IF stage is responsible for obtaining the requested instruction from memory. The instruction and
    the program counter are stored in the register as temporary storage.

    Decode Instruction • The DI stage is responsible for decoding the instruction and sending out the various control lines to
    the other parts of the processor.

    Calculate Operands • The CO stage is where any calculations are performed. The main component in this stage is the ALU.
    The ALU is made up of arithmetic, logic and capabilities.

    Fetch Operands and Execute Instruction • The FO and EI stages are responsible for storing and loading values to and from memory.
    They also responsible for input and output from the processor respectively.

    Write Operands • The WO stage is responsible for writing the result of a calculation, memory access or input into
    the register file.



    Six Stage Instruction Pipeline


    Timing Diagram for Instruction Pipeline Operation

     

     

     

    Pipelining in Computer Architecture


    Pipelining in Computer Architecture


    Pipelining in Computer Architecture

     

     

     

     

    Pipeline Performance: Clock & Timing Si Si+1  m d Clock cycle of the pipeline :  Latch delay : d  = max {m } + d Pipeline
    frequency : f f = 1 /  6


     

    Pipeline Performance: Speedup & Efficiency k-stage pipeline processes n tasks in k + (n-1) clock cycles: k cycles for the first task and n-1 cycles for the remaining n-1 tasks Total time to process n tasks Tk = [ k + (n-1)]

    For the non-pipelined processor T1 = n k Speedup factor Sk = T1 Tk = n k  [ k + (n-1)]  = n k k + (n-1) 7




    Advantages

    Pipelining makes efficient use of resources.
    Quicker time of execution of large number of instructions
    The parallelism is invisible to the programmer.


    Disclaimer

     

    All tutorials are for informational and educational purposes only and have been made using our own routers, servers, websites and other vulnerable free resources. we do not contain any illegal activity. We believe that ethical hacking, information security and cyber security should be familiar subjects to anyone using digital information and computers. Hacking Truth is against misuse of the information and we strongly suggest against it. Please regard the word hacking as ethical hacking or penetration testing every time this word is used. We do not promote, encourage, support or excite any illegal activity or hacking.

     

     

  • MySQL Transactions


    MySQL Transactions

     

     

    MySQL Transactions


    What are transactions?

    # Sequential group of DML statements, which is performed as if it were one single work unit.


    # Will never complete unless each individual operation within the group is sucessful.If any operation within the transaction fails, the entire transaction will fail.

    # Begins with the first executable SQL statement.

    # Ends when it is committed or rolled back, either explicitly with a COMMIT or ROLLBACK statement or implicitly when a DDL statement
    is issued.




    Sample Scenario



    Suppose a bank customer transfers money from his savings account (SB a/c) to his current account (CA a/c), the statement will be divided into four blocks:



    # Debit SB a/c
    # Credit CA a/c
    # Record in Transaction Journal.
    # End Transaction




    The SQL statement to debit SB a/c is as follows:

    UPDATE sb_accounts SET balance = balance - 500 WHERE account_no = 932656;



    The SQL statement to credit CA a/c is as follows:

    UPDATE ca_accounts SET balance = balance + 500 WHERE account_no = 933456;



    The SQL statement for recording in the transaction journal is as follows:

    INSERT INTO journal VALUES (100896, 'Transaction on Kumar Atul Jaiswal a/c', '28-NOV-11' 932656, 933456, 500);


    The SQL statement for End Transaction is as follows:


    COMMIT WORK;

     

     

    Ensures that all operations within the work unit are completed successfully; otherwise, the transaction is aborted at the point of failure and previous operations are rolled back to their former state.

     

     

    Disclaimer

     

    All tutorials are for informational and educational purposes only and have been made using our own routers, servers, websites and other vulnerable free resources. we do not contain any illegal activity. We believe that ethical hacking, information security and cyber security should be familiar subjects to anyone using digital information and computers. Hacking Truth is against misuse of the information and we strongly suggest against it. Please regard the word hacking as ethical hacking or penetration testing every time this word is used. We do not promote, encourage, support or excite any illegal activity or hacking.

     

     

  • Memory Subsystem in Computer Architecture


     

    Memory Subsystem

     

    Microcomputer Memory


    Memory is an essential component of the microcomputer system.
    It stores binary instructions and datum for the microcomputer.


    The memory is the place where the computer holds current programs and data that are in use. None technology is optimal in satisfying the memory requirements for a computer system.


    Computer memory exhibits perhaps the widest range of type, technology, organization, performance and cost of any feature of a computer system. The memory unit that communicates directly with the CPU is called main memory. Devices that provide backup storage are called auxiliary memory or secondary memory.



     

    Characteristics of memory systems


    • The memory system can be characterised with their Location, Capacity, Unit of transfer, Access method, Performance,
    • Physical type, Physical characteristics, Organisation.




    RAM, ROM, DRAM, Flash Memory


    • The main memory is a Random Access Memory. It is organized into words of fixed length.
    • The length of a word is called word length.
    • Each of these memory words has an independent address and each has the same number of bits.
    • Normally the total numbers of words in memory are some power of 2. Some typical memory word size are 8 bits, 16 bits, 32 bits etc.
    • The main memory can be both read and written into, therefore it is called read-write memory. 
    • The block diagram of a read- write memory of RAM is shown in figure. 

     

     


    memory subsystem


     

    The access time and cycle time in RAM are constant and independent of the location accessed. The computer places the address of the location into which the data are to be read into the memory address register. This register consist of n binary devices (generally flip-flops), where 2n is the number of words that can be stored in the memory. Example : A 32 × 4 RAM means that this RAM has 32 words, 5 address lines (25 = 32), and 4 bit data word size.



    Dram (Dynamic Random Access Memory)


    RAM technology is divided into two technologies : Dynamic and Static. A Dynamic RAM (DRAM) is made with cells that store data as charge on capacitors. The presence and absence of charge on capacitor is interpreted as binary 0 or 1. Since the capacitors have natural tendency to discharge Dynamic RAM requires periodic charge refreshing to maintain data storage.



    ROM (Read-Only Memory)


    A ROM is a memory or storage device in which a fixed set of binary information is stored. A ROM is a device with several input and output lines such that for each input value there is a unique output value. A block diagram of ROM is shown in the figure 3.


    It consist n input lines and m output lines. Each combination of the input variables in called an address. Each bit combination that comes out of
    the output lines in called a word. The number of bits per word is equal to the number of output lines m. The number of distinct address possible with n input
    variable is 2n.



     

    memory subsystem

     

     

    A ROM is characterized by the number of words (2n) and number of bits (m) per word. For example a 16 × 8 ROM which can be written as 24 × 8 consist of 16 words of 8 bit each, which mean there are 8 output lines and 16 distinct words stored in the unit. There are only 4 input lines because 16 = 24 and with 4 binary variable we can specify 16 address. A ROM is basically a combinational circuit and can be constructed as shown in figure 3 (c). On applying an Input I1 = 0, I2 = 0, the 00 line of the decoder is selected and we will get O1 = 0 and O2 = 1;
    on applying I1 = 0 and I2 = 1 we will get O1 = 1 and O2 = 0. The same logic is used for constructing larger ROM.




     

    Flash Memory :


    Flash Memory is a form of semiconductor memory which was first introduced
    in mid-1980. These memories can be reprogrammed at high speed and hence the
    name flash. These are electronic Random Access Memory but non-volatile in nature. 

    In flash memory the entire memory can be erased in a few seconds by using electric erasing technology. It is used in many I/O devices. It is also used to store data and programming algorithm in cell phones, digital cameras and MP3 music players. Basically flash memory falls in between EPROM and EEPROM.




    There are two kinds of flash memory :


    (i) Code storage flashmade by Intel, AMD, Atmel, etc. It stores
    programming algorithms and is largely found in cell phones 

    (ii) Data storage Flashmade by San Disk, Toshiba etc. It stores data and
    comes in digital cameras and MP3 players.

     

     

    Disclaimer

     

    All tutorials are for informational and educational purposes only and have been made using our own routers, servers, websites and other vulnerable free resources. we do not contain any illegal activity. We believe that ethical hacking, information security and cyber security should be familiar subjects to anyone using digital information and computers. Hacking Truth is against misuse of the information and we strongly suggest against it. Please regard the word hacking as ethical hacking or penetration testing every time this word is used. We do not promote, encourage, support or excite any illegal activity or hacking.

     

  • Hierarchy of Memory

     

    Hierarchy of Memory


    Hierarchy of Memory


    Memory hierarchy Main Memory: memory unit that communicates directly with the CPU (RAM). Hierarchy of Memory


    Auxiliary Memory: device that provide backup storage (Disk Drives) Example of auxiliary memory: magnetic disks and tapes.  They are used for storing system programs, large data files, and other backup information  Only program programs and data currently needed by the processor reside in main memory.  All other information is stored in auxiliary memory and transferred to main memory when needed.


    Hierarchy of Memory



    Memory hierarchy system consists of all storage devices from the slow but high-capacity auxiliary memory to relatively faster main memory, to an even smaller and faster cache memory.

    Magnetic tapes used to store removable files and disks used as backup storage.  CPU communicates with auxiliary memory through I/O processor. 

     

    Cache Memory: special very-high-speed memory to increase the processing speed (Cache RAM)

    It is used to compensate the speed differential between main memory access time and processor logic.

    CPU logic is faster than main memory access.

    So small cache employed between CPU and main memory whose access time is close to processor logic clock cycle.

    So it is possible to increase the performance rate of the computer.

    As the storage capacity of the memory increases, the cost per bit for storing binary information decreases and the access time of the memory becomes longer.



    Example


    Auxiliary memory has a large storage capacity, is relatively inexpensive, but has low access speed compared to main memory.

    The cache memory is very small, relatively expensive, and has very high access speed.




    Goal of memory hierarchy


    To obtain the highest-possible average access speed while minimizing the total cost.




    Ratio


    Access time ratio between cache and main memory is about 1 to 7.


    For Example


    Cache memory may have an access time of 100ns, while main memory access time may be 700ns.

    Auxiliary memory average access time is usually 1000 times that of main memory.


    Block Size


    Block size in auxiliary memory typically ranges from 256 to 2048 words, while cache block size is typically from 1 to 16 words.




    Multiprogramming


    Multiprogramming refers to the existence of two or more programs in different parts of the memory hierarchy at the same time.

    For example, when one program is waiting for input or output transfer, there is another program ready to utilize the CPU.




    Memory management


    A program with its data normally resides in auxiliary memory. When the program or a segment of the program is to be executed, it is transferred to main memory to be executed by the CPU.  It is the task of the operating system to maintain in main memory a portion of this information that is currently active.
    3.  The part of the computer system that supervises the flow of information between auxiliary memory and main memory is called the memory management system.





    Disclaimer

     

    All tutorials are for informational and educational purposes only and have been made using our own routers, servers, websites and other vulnerable free resources. we do not contain any illegal activity. We believe that ethical hacking, information security and cyber security should be familiar subjects to anyone using digital information and computers. Hacking Truth is against misuse of the information and we strongly suggest against it. Please regard the word hacking as ethical hacking or penetration testing every time this word is used. We do not promote, encourage, support or excite any illegal activity or hacking.

     

     

  • WHAT WE DO

    We've been developing corporate tailored services for clients for 30 years.

    CONTACT US

    For enquiries you can contact us in several different ways. Contact details are below.

    Hacking Truth.in

    • Street :Road Street 00
    • Person :Person
    • Phone :+045 123 755 755
    • Country :POLAND
    • Email :contact@heaven.com

    Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.

    Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation.